Submission #1586623
Source Code Expand
#include <bits/stdc++.h> using namespace std; const int N = 100001; int n; int ans[N]; vector<vector<int> > adjList(N); int solve(int node) { ans[node] = adjList[node].size(); for(int ch : adjList[node]) ans[node] = max(solve(ch)+1,ans[node]); return ans[node]; } int main() { scanf("%d",&n); for(int i = 2;i<=n;i++) { int x; scanf("%d",&x); adjList[x].push_back(i); } printf("%d",solve(1)); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Tournament |
User | vjudge4 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 472 Byte |
Status | WA |
Exec Time | 22 ms |
Memory | 9216 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:19:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^ ./Main.cpp:22:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&x); ^
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 | 22 ms | 4608 KB |
02.txt | WA | 22 ms | 4608 KB |
03.txt | WA | 20 ms | 4608 KB |
04.txt | WA | 22 ms | 4608 KB |
05.txt | AC | 22 ms | 4608 KB |
06.txt | WA | 22 ms | 4608 KB |
07.txt | AC | 20 ms | 4608 KB |
08.txt | AC | 22 ms | 4608 KB |
09.txt | AC | 22 ms | 4608 KB |
10.txt | WA | 20 ms | 4608 KB |
11.txt | AC | 20 ms | 9216 KB |
12.txt | AC | 19 ms | 7424 KB |
13.txt | AC | 20 ms | 6784 KB |
14.txt | AC | 19 ms | 6144 KB |
15.txt | AC | 19 ms | 5760 KB |
16.txt | AC | 19 ms | 5376 KB |
17.txt | WA | 20 ms | 5120 KB |
18.txt | AC | 20 ms | 4992 KB |
19.txt | WA | 21 ms | 4992 KB |
20.txt | AC | 21 ms | 4992 KB |
21.txt | AC | 11 ms | 3448 KB |
22.txt | AC | 11 ms | 3492 KB |
23.txt | AC | 11 ms | 3444 KB |
24.txt | AC | 11 ms | 3584 KB |
25.txt | AC | 11 ms | 3456 KB |
26.txt | AC | 11 ms | 3456 KB |
27.txt | AC | 12 ms | 3456 KB |
28.txt | AC | 11 ms | 3584 KB |
29.txt | AC | 13 ms | 3584 KB |
30.txt | AC | 13 ms | 3584 KB |
31.txt | WA | 18 ms | 4480 KB |
32.txt | WA | 17 ms | 3968 KB |
33.txt | WA | 16 ms | 3712 KB |
34.txt | WA | 16 ms | 3712 KB |
35.txt | WA | 16 ms | 3840 KB |
36.txt | WA | 14 ms | 3456 KB |
37.txt | WA | 13 ms | 3456 KB |
38.txt | WA | 12 ms | 3456 KB |
39.txt | WA | 11 ms | 3456 KB |
40.txt | WA | 11 ms | 3328 KB |
41.txt | WA | 2 ms | 2560 KB |
42.txt | AC | 2 ms | 2560 KB |
43.txt | AC | 2 ms | 2560 KB |
44.txt | AC | 2 ms | 2560 KB |
45.txt | AC | 2 ms | 2560 KB |
46.txt | WA | 2 ms | 2560 KB |
47.txt | AC | 2 ms | 2560 KB |
48.txt | AC | 2 ms | 2560 KB |
49.txt | AC | 2 ms | 2560 KB |
50.txt | AC | 2 ms | 2560 KB |
s1.txt | AC | 2 ms | 2560 KB |
s2.txt | AC | 2 ms | 2560 KB |
s3.txt | AC | 2 ms | 2560 KB |