Submission #1602680
Source Code Expand
#include <iostream> #include <cmath> #include <cstdio> #include <algorithm> #include <vector> #include <queue> #include <set> #include <cassert> using namespace std; vector < vector < int > > graph; int n, A[100050], B[100050], d[100050]; int dfs(int node, int par) { if(!graph[node].size()) return 0; vector < int > x; for(int i = 0;i < graph[node].size();++i) { int to = graph[node][i]; if(to != par) x.push_back(dfs(to, node)); } sort(x.begin(), x.end()); int ans = 0; for(int i = 0;i < x.size();++i) ans = max(ans + 1, x[i] + 1); return ans; } int main() { scanf("%d", &n); graph.resize(n + 5); for(int i = 2;i < n + 1;++i) { scanf("%d", A + i); graph[A[i]].push_back(i); } int ans = dfs(1, -1); printf("%d\n", ans); return 0; } /* 9 1 1 2 4 2 2 7 7 */
Submission Info
Submission Time | |
---|---|
Task | B - Tournament |
User | vjudge3 |
Language | C++14 (GCC 5.4.1) |
Score | 800 |
Code Size | 896 Byte |
Status | AC |
Exec Time | 28 ms |
Memory | 15488 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:37:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &n); ^ ./Main.cpp:41:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", A + i); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 800 / 800 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 50.txt, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 26 ms | 4608 KB |
02.txt | AC | 27 ms | 4608 KB |
03.txt | AC | 27 ms | 4608 KB |
04.txt | AC | 28 ms | 4608 KB |
05.txt | AC | 27 ms | 4608 KB |
06.txt | AC | 25 ms | 4608 KB |
07.txt | AC | 27 ms | 4608 KB |
08.txt | AC | 25 ms | 4608 KB |
09.txt | AC | 28 ms | 4608 KB |
10.txt | AC | 27 ms | 4608 KB |
11.txt | AC | 27 ms | 15488 KB |
12.txt | AC | 27 ms | 12032 KB |
13.txt | AC | 26 ms | 10368 KB |
14.txt | AC | 26 ms | 8576 KB |
15.txt | AC | 25 ms | 7296 KB |
16.txt | AC | 24 ms | 6272 KB |
17.txt | AC | 25 ms | 5632 KB |
18.txt | AC | 25 ms | 5120 KB |
19.txt | AC | 26 ms | 4992 KB |
20.txt | AC | 27 ms | 4992 KB |
21.txt | AC | 11 ms | 4088 KB |
22.txt | AC | 12 ms | 3808 KB |
23.txt | AC | 12 ms | 3820 KB |
24.txt | AC | 12 ms | 3760 KB |
25.txt | AC | 11 ms | 3584 KB |
26.txt | AC | 12 ms | 3456 KB |
27.txt | AC | 12 ms | 3584 KB |
28.txt | AC | 12 ms | 3584 KB |
29.txt | AC | 13 ms | 3584 KB |
30.txt | AC | 13 ms | 3584 KB |
31.txt | AC | 23 ms | 4480 KB |
32.txt | AC | 22 ms | 3968 KB |
33.txt | AC | 20 ms | 3712 KB |
34.txt | AC | 19 ms | 3712 KB |
35.txt | AC | 19 ms | 3840 KB |
36.txt | AC | 15 ms | 3456 KB |
37.txt | AC | 14 ms | 3456 KB |
38.txt | AC | 13 ms | 3456 KB |
39.txt | AC | 12 ms | 3456 KB |
40.txt | AC | 12 ms | 3328 KB |
41.txt | AC | 1 ms | 256 KB |
42.txt | AC | 1 ms | 256 KB |
43.txt | AC | 1 ms | 256 KB |
44.txt | AC | 1 ms | 256 KB |
45.txt | AC | 1 ms | 256 KB |
46.txt | AC | 1 ms | 256 KB |
47.txt | AC | 1 ms | 256 KB |
48.txt | AC | 1 ms | 256 KB |
49.txt | AC | 1 ms | 256 KB |
50.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |