Submission #1868012
Source Code Expand
#include <iostream> #include <cstdio> #include <cstring> using namespace std; const int MAXN = 1e5 + 10; class Edges{ public: int next , to; }; Edges edge[MAXN * 2]; int first[MAXN]; int n , k , x; int ans = 0 , te = 0; void add(int s , int t){ ++ te; edge[te].next = first[s]; edge[te].to = t; first[s] = te; } int set(int pos , int fa){ int maxn = 1; for(int e = first[pos] ; e ; e = edge[e].next){ int to = edge[e].to; if(to == fa) continue; maxn = max(maxn , set(to , pos) + 1); } if(maxn == k && fa != 1){ ans ++; return 0; } else return maxn; } int main(){ cin >> n >> k >> x; if(x != 1) ans ++; for(int i = 2 ; i <= n ; ++ i){ cin >> x; add(x , i); add(i , x); } set(1 , 1); cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Teleporter |
User | Rchen |
Language | C++14 (GCC 5.4.1) |
Score | 800 |
Code Size | 800 Byte |
Status | AC |
Exec Time | 46 ms |
Memory | 6912 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 | 1 ms | 256 KB |
0_01.txt | AC | 1 ms | 256 KB |
0_02.txt | AC | 1 ms | 256 KB |
1_00.txt | AC | 1 ms | 256 KB |
1_01.txt | AC | 1 ms | 256 KB |
1_02.txt | AC | 43 ms | 6912 KB |
1_03.txt | AC | 44 ms | 6912 KB |
1_04.txt | AC | 43 ms | 6912 KB |
1_05.txt | AC | 45 ms | 6912 KB |
1_06.txt | AC | 44 ms | 6912 KB |
1_07.txt | AC | 45 ms | 6912 KB |
1_08.txt | AC | 43 ms | 6912 KB |
1_09.txt | AC | 44 ms | 6912 KB |
1_10.txt | AC | 43 ms | 4480 KB |
1_11.txt | AC | 42 ms | 4480 KB |
1_12.txt | AC | 43 ms | 4480 KB |
1_13.txt | AC | 42 ms | 2176 KB |
1_14.txt | AC | 42 ms | 2176 KB |
1_15.txt | AC | 41 ms | 2176 KB |
1_16.txt | AC | 30 ms | 2176 KB |
1_17.txt | AC | 30 ms | 2176 KB |
1_18.txt | AC | 31 ms | 2176 KB |
1_19.txt | AC | 20 ms | 2176 KB |
1_20.txt | AC | 20 ms | 2176 KB |
1_21.txt | AC | 20 ms | 2176 KB |
1_22.txt | AC | 41 ms | 2176 KB |
1_23.txt | AC | 40 ms | 2176 KB |
1_24.txt | AC | 39 ms | 2176 KB |
1_25.txt | AC | 39 ms | 2176 KB |
1_26.txt | AC | 40 ms | 2176 KB |
1_27.txt | AC | 40 ms | 2176 KB |
1_28.txt | AC | 39 ms | 2176 KB |
1_29.txt | AC | 38 ms | 2176 KB |
1_30.txt | AC | 38 ms | 2176 KB |
1_31.txt | AC | 39 ms | 2176 KB |
1_32.txt | AC | 39 ms | 2176 KB |
1_33.txt | AC | 41 ms | 2176 KB |
1_34.txt | AC | 40 ms | 2176 KB |
1_35.txt | AC | 42 ms | 2176 KB |
1_36.txt | AC | 40 ms | 2176 KB |
1_37.txt | AC | 42 ms | 2176 KB |
1_38.txt | AC | 40 ms | 2176 KB |
1_39.txt | AC | 41 ms | 2176 KB |
1_40.txt | AC | 41 ms | 2176 KB |
1_41.txt | AC | 41 ms | 2176 KB |
1_42.txt | AC | 41 ms | 2176 KB |
1_43.txt | AC | 41 ms | 2432 KB |
1_44.txt | AC | 41 ms | 2432 KB |
1_45.txt | AC | 41 ms | 2432 KB |
1_46.txt | AC | 41 ms | 2432 KB |
1_47.txt | AC | 42 ms | 3456 KB |
1_48.txt | AC | 42 ms | 3456 KB |
1_49.txt | AC | 41 ms | 3456 KB |
1_50.txt | AC | 42 ms | 3456 KB |
1_51.txt | AC | 44 ms | 6144 KB |
1_52.txt | AC | 46 ms | 6144 KB |
1_53.txt | AC | 43 ms | 6144 KB |
1_54.txt | AC | 44 ms | 6144 KB |