Submission #1024748
Source Code Expand
#include <algorithm> #include <cassert> #include <cfloat> #include <climits> #include <cmath> #include <cstdio> #include <cstdlib> #include <deque> #include <iomanip> #include <iostream> #include <limits> #include <map> #include <queue> #include <set> #include <sstream> #include <stack> #include <string> #include <vector> #define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i)) #define rep(i,n) FOR(i,0,n) #define pb push_back #define eb emplace_back #define mp make_pair #define fst first #define snd second #define all(v) begin(v), end(v) #define debug(x) cerr<< #x <<": "<<x<<endl #define debug2(x,y) cerr<< #x <<": "<< x <<", "<< #y <<": "<< y <<endl using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef vector<int> vi; typedef vector<vector<int> > vvi; typedef vector<ll> vll; typedef vector<vector<ll> > vvll; template<class T> using vv=vector<vector< T > >; // cout pair template<typename T1, typename T2> ostream& operator<<(ostream& s, const pair<T1, T2>& p) { s << p.first << " " << p.second << "\n"; return s; } // cout vector<pair> template<typename T1, typename T2> ostream& operator<<(ostream& s, const vector<pair<T1, T2> >& vp) { int len = vp.size(); s << "\n"; for (int i = 0; i < len; ++i) { s << vp[i]; } s << "\n"; return s; } // cout vector template<typename T> ostream& operator<<(ostream& s, const vector<T>& v) { int len = v.size(); s << "\n"; for (int i = 0; i < len; ++i) { s << v[i]; if (i < len - 1) s << "\t"; } s << "\n"; return s; } // cout deque template<typename T> ostream& operator<<(ostream& s, const deque<T>& v) { int len = v.size(); s << "\n"; for (int i = 0; i < len; ++i) { s << v[i]; if (i < len - 1) s << "\t"; } s << "\n"; return s; } // cout 2-dimentional vector template<typename T> ostream& operator<<(ostream& s, const vector< vector<T> >& vv) { int len = vv.size(); for (int i = 0; i < len; ++i) { s << vv[i]; } return s; } // cout 2-dimentional deque template<typename T> ostream& operator<<(ostream& s, const deque< deque<T> >& vv) { int len = vv.size(); for (int i = 0; i < len; ++i) { s << vv[i]; } return s; } int n, k; vector<vector<int> > child; int ans; vi a; int solve(int x) { int len = child[x].size(); if (len == 0) { return 0; } int ret = -5; rep (i, len) { int s = solve(child[x][i]); ret = max(ret, s); } ret += 1; if (x != 0 && ret == k-1 && a[x] != 0) { ans += 1; ret = -1; } return ret; } int main() { scanf("%d %d", &n, &k); a.resize(n); rep (i, n) { scanf("%d", &a[i]); a[i] -= 1; } ans = 0; if (k == 1) { rep (i, n) { if (a[i] != 0) { ans += 1; } } printf("%d\n", ans); return 0; } if (a[0] != 0) { ans += 1; a[0] = 0; } child.resize(n); FOR (i, 1, n) { child[a[i]].pb(i); } solve(0); printf("%d\n", ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Teleporter |
User | tspcx |
Language | C++14 (Clang 3.8.0) |
Score | 800 |
Code Size | 3070 Byte |
Status | AC |
Exec Time | 36 ms |
Memory | 12416 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 800 / 800 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt, 1_47.txt, 1_48.txt, 1_49.txt, 1_50.txt, 1_51.txt, 1_52.txt, 1_53.txt, 1_54.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 3 ms | 256 KB |
0_01.txt | AC | 3 ms | 256 KB |
0_02.txt | AC | 3 ms | 256 KB |
1_00.txt | AC | 3 ms | 256 KB |
1_01.txt | AC | 3 ms | 256 KB |
1_02.txt | AC | 13 ms | 640 KB |
1_03.txt | AC | 36 ms | 12416 KB |
1_04.txt | AC | 36 ms | 12416 KB |
1_05.txt | AC | 36 ms | 12416 KB |
1_06.txt | AC | 36 ms | 12416 KB |
1_07.txt | AC | 36 ms | 12416 KB |
1_08.txt | AC | 36 ms | 12416 KB |
1_09.txt | AC | 36 ms | 12416 KB |
1_10.txt | AC | 13 ms | 640 KB |
1_11.txt | AC | 35 ms | 9216 KB |
1_12.txt | AC | 32 ms | 9216 KB |
1_13.txt | AC | 13 ms | 768 KB |
1_14.txt | AC | 29 ms | 6144 KB |
1_15.txt | AC | 29 ms | 6144 KB |
1_16.txt | AC | 13 ms | 640 KB |
1_17.txt | AC | 22 ms | 4732 KB |
1_18.txt | AC | 22 ms | 4732 KB |
1_19.txt | AC | 11 ms | 640 KB |
1_20.txt | AC | 15 ms | 3580 KB |
1_21.txt | AC | 15 ms | 3580 KB |
1_22.txt | AC | 13 ms | 640 KB |
1_23.txt | AC | 25 ms | 4608 KB |
1_24.txt | AC | 25 ms | 4608 KB |
1_25.txt | AC | 13 ms | 640 KB |
1_26.txt | AC | 24 ms | 4096 KB |
1_27.txt | AC | 24 ms | 4096 KB |
1_28.txt | AC | 13 ms | 640 KB |
1_29.txt | AC | 18 ms | 3712 KB |
1_30.txt | AC | 18 ms | 3712 KB |
1_31.txt | AC | 26 ms | 4608 KB |
1_32.txt | AC | 26 ms | 4608 KB |
1_33.txt | AC | 26 ms | 4608 KB |
1_34.txt | AC | 26 ms | 4608 KB |
1_35.txt | AC | 28 ms | 4992 KB |
1_36.txt | AC | 27 ms | 4992 KB |
1_37.txt | AC | 27 ms | 4992 KB |
1_38.txt | AC | 27 ms | 4992 KB |
1_39.txt | AC | 28 ms | 4992 KB |
1_40.txt | AC | 27 ms | 4992 KB |
1_41.txt | AC | 28 ms | 4992 KB |
1_42.txt | AC | 28 ms | 4992 KB |
1_43.txt | AC | 28 ms | 5248 KB |
1_44.txt | AC | 28 ms | 5376 KB |
1_45.txt | AC | 28 ms | 5376 KB |
1_46.txt | AC | 28 ms | 5248 KB |
1_47.txt | AC | 30 ms | 6784 KB |
1_48.txt | AC | 31 ms | 6912 KB |
1_49.txt | AC | 30 ms | 6912 KB |
1_50.txt | AC | 30 ms | 6912 KB |
1_51.txt | AC | 35 ms | 11136 KB |
1_52.txt | AC | 35 ms | 11008 KB |
1_53.txt | AC | 35 ms | 11136 KB |
1_54.txt | AC | 35 ms | 11136 KB |