Submission #1074407
Source Code Expand
#include <cstdio> #include <vector> using namespace std; int N; int a[100010]; vector<vector<int> > Tree(100010); int len[100010]; void dfs(int u) { int i; for(i=0; i<Tree[u].size(); i++){ int v = Tree[u][i]; len[v] = len[u] + 1; dfs(v); } } void solve() { int i; for(i=1; i<N; i++){ Tree[a[i]].push_back(i); } len[0] = 0; dfs(0); int res = 0; for(i=0; i<N; i++){ if(res < len[i]) res = len[i]; } printf("%d\n", res); } int main() { int i; scanf("%d", &N); for(i=1; i<N; i++){ scanf("%d", &a[i]); a[i] --; } solve(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Tournament |
User | treeofapple |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 612 Byte |
Status | WA |
Exec Time | 28 ms |
Memory | 9600 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:39:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &N); ^ ./Main.cpp:41:21: 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 | 0 / 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 | WA | 26 ms | 4992 KB |
02.txt | WA | 26 ms | 4992 KB |
03.txt | WA | 26 ms | 4992 KB |
04.txt | WA | 26 ms | 4992 KB |
05.txt | WA | 27 ms | 4992 KB |
06.txt | WA | 26 ms | 4992 KB |
07.txt | WA | 28 ms | 4992 KB |
08.txt | WA | 26 ms | 4992 KB |
09.txt | WA | 26 ms | 4992 KB |
10.txt | WA | 26 ms | 4992 KB |
11.txt | AC | 27 ms | 9600 KB |
12.txt | AC | 26 ms | 7808 KB |
13.txt | AC | 26 ms | 7168 KB |
14.txt | WA | 25 ms | 6528 KB |
15.txt | WA | 25 ms | 6144 KB |
16.txt | WA | 25 ms | 5760 KB |
17.txt | WA | 25 ms | 5504 KB |
18.txt | WA | 25 ms | 5376 KB |
19.txt | WA | 26 ms | 5376 KB |
20.txt | WA | 26 ms | 5376 KB |
21.txt | WA | 15 ms | 3832 KB |
22.txt | WA | 15 ms | 3876 KB |
23.txt | WA | 16 ms | 3828 KB |
24.txt | WA | 15 ms | 3968 KB |
25.txt | WA | 15 ms | 3840 KB |
26.txt | WA | 16 ms | 3840 KB |
27.txt | WA | 16 ms | 3840 KB |
28.txt | WA | 16 ms | 3968 KB |
29.txt | WA | 17 ms | 3968 KB |
30.txt | WA | 18 ms | 3968 KB |
31.txt | WA | 22 ms | 4864 KB |
32.txt | WA | 21 ms | 4352 KB |
33.txt | WA | 20 ms | 4096 KB |
34.txt | WA | 20 ms | 4096 KB |
35.txt | WA | 19 ms | 4224 KB |
36.txt | WA | 18 ms | 3840 KB |
37.txt | WA | 17 ms | 3840 KB |
38.txt | WA | 16 ms | 3840 KB |
39.txt | WA | 16 ms | 3840 KB |
40.txt | WA | 15 ms | 3712 KB |
41.txt | WA | 5 ms | 2560 KB |
42.txt | AC | 5 ms | 2560 KB |
43.txt | WA | 5 ms | 2560 KB |
44.txt | AC | 5 ms | 2560 KB |
45.txt | WA | 5 ms | 2560 KB |
46.txt | WA | 5 ms | 2560 KB |
47.txt | AC | 5 ms | 2560 KB |
48.txt | AC | 5 ms | 2560 KB |
49.txt | WA | 5 ms | 2560 KB |
50.txt | WA | 5 ms | 2560 KB |
s1.txt | AC | 5 ms | 2560 KB |
s2.txt | AC | 5 ms | 2560 KB |
s3.txt | WA | 5 ms | 2560 KB |