Submission #1077298
Source Code Expand
#include <vector> #include <map> #include <algorithm> #include <cstdio> using namespace std; map<int,vector<int>>H; int f(int i){ vector<int>a; for(auto &e:H[i])a.push_back(-f(e)); sort(a.begin(),a.end()); int r=0; for(int i=1;i<=a.size();i++)r=max(r,i-a[i-1]); return r; } int main(){ int N,a; scanf("%d",&N); for(int i=2;i<=N;i++)scanf("%d",&a),H[a].push_back(i); printf("%d\n",f(1)); }
Submission Info
Submission Time | |
---|---|
Task | B - Tournament |
User | leafmoon |
Language | C++14 (GCC 5.4.1) |
Score | 800 |
Code Size | 422 Byte |
Status | AC |
Exec Time | 91 ms |
Memory | 22144 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:19:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&N); ^ ./Main.cpp:20:55: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for(int i=2;i<=N;i++)scanf("%d",&a),H[a].push_back(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 | 90 ms | 9600 KB |
02.txt | AC | 90 ms | 9600 KB |
03.txt | AC | 90 ms | 9728 KB |
04.txt | AC | 90 ms | 9600 KB |
05.txt | AC | 90 ms | 9728 KB |
06.txt | AC | 90 ms | 9728 KB |
07.txt | AC | 91 ms | 9600 KB |
08.txt | AC | 90 ms | 9600 KB |
09.txt | AC | 91 ms | 9600 KB |
10.txt | AC | 90 ms | 9728 KB |
11.txt | AC | 78 ms | 22144 KB |
12.txt | AC | 74 ms | 18176 KB |
13.txt | AC | 72 ms | 16128 KB |
14.txt | AC | 61 ms | 14080 KB |
15.txt | AC | 59 ms | 12800 KB |
16.txt | AC | 58 ms | 11520 KB |
17.txt | AC | 59 ms | 10880 KB |
18.txt | AC | 60 ms | 10240 KB |
19.txt | AC | 67 ms | 10112 KB |
20.txt | AC | 70 ms | 9984 KB |
21.txt | AC | 39 ms | 8824 KB |
22.txt | AC | 37 ms | 8672 KB |
23.txt | AC | 37 ms | 8688 KB |
24.txt | AC | 39 ms | 8624 KB |
25.txt | AC | 39 ms | 8576 KB |
26.txt | AC | 41 ms | 8576 KB |
27.txt | AC | 43 ms | 8576 KB |
28.txt | AC | 51 ms | 8576 KB |
29.txt | AC | 59 ms | 8704 KB |
30.txt | AC | 65 ms | 8704 KB |
31.txt | AC | 65 ms | 9600 KB |
32.txt | AC | 58 ms | 9088 KB |
33.txt | AC | 54 ms | 8832 KB |
34.txt | AC | 56 ms | 8832 KB |
35.txt | AC | 54 ms | 8960 KB |
36.txt | AC | 44 ms | 8576 KB |
37.txt | AC | 38 ms | 8704 KB |
38.txt | AC | 37 ms | 8704 KB |
39.txt | AC | 33 ms | 8576 KB |
40.txt | AC | 33 ms | 8448 KB |
41.txt | AC | 3 ms | 256 KB |
42.txt | AC | 3 ms | 256 KB |
43.txt | AC | 2 ms | 256 KB |
44.txt | AC | 3 ms | 256 KB |
45.txt | AC | 2 ms | 256 KB |
46.txt | AC | 3 ms | 256 KB |
47.txt | AC | 2 ms | 256 KB |
48.txt | AC | 3 ms | 256 KB |
49.txt | AC | 2 ms | 256 KB |
50.txt | AC | 2 ms | 256 KB |
s1.txt | AC | 2 ms | 256 KB |
s2.txt | AC | 3 ms | 256 KB |
s3.txt | AC | 2 ms | 256 KB |