Submission #1676709
Source Code Expand
#include<cstdio> #include<iostream> #include<algorithm> #include<ctime> #include<cstdlib> #include<algorithm> #include<cmath> #include<queue> #include<cstring> #include<map> #include<vector> #include<set> #define rep(i,j,k) for(register int i = j; i <= k; i++) #define dow(i,j,k) for(register int i = j; i >= k; i--) #define fi first #define se second //#define P pair<ull,ull> //#define PP pair<int,pair<int,int> > //#define mp(a,b) make_pair(a,b) #define ll long long #define ull unsigned long long using namespace std; inline int read() { int s = 0, t = 1; char c = getchar(); while( !isdigit(c) ) { if( c == '-' ) t = -1; c = getchar(); } while( isdigit(c) ) s = s * 10 + c - 48, c = getchar(); return s * t; } const int N = 1e5+5, p = 1e9+7; struct edge{ int to, nxt; } e[N]; int f[N], g[N], deg[N], head[N], cnt = 0; inline void add(int x,int y) { deg[x]++; e[++cnt].to = y, e[cnt].nxt = head[x], head[x] = cnt; } #define ez(i,j) for(register int i = head[j]; i; i=e[i].nxt) #define to e[i].to inline void dfs(int x) { if( !deg[x] ) return; int len = 0, y = 0; ez(i,x) dfs(to); ez(i,x) g[++len] = f[to]; sort(g+1,g+len+1); rep(i,1,len) y = max(y+1,g[i]+1); f[x] = y; } int main() { int n = read(); rep(i,2,n) add(read(),i); dfs(1); cout<<f[1]<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Tournament |
User | yylidiw |
Language | C++14 (GCC 5.4.1) |
Score | 800 |
Code Size | 1353 Byte |
Status | AC |
Exec Time | 12 ms |
Memory | 4736 KB |
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 | 12 ms | 2176 KB |
02.txt | AC | 12 ms | 2176 KB |
03.txt | AC | 12 ms | 2176 KB |
04.txt | AC | 12 ms | 2176 KB |
05.txt | AC | 12 ms | 2176 KB |
06.txt | AC | 12 ms | 2176 KB |
07.txt | AC | 12 ms | 2176 KB |
08.txt | AC | 12 ms | 2176 KB |
09.txt | AC | 12 ms | 2176 KB |
10.txt | AC | 12 ms | 2176 KB |
11.txt | AC | 10 ms | 4736 KB |
12.txt | AC | 10 ms | 3840 KB |
13.txt | AC | 10 ms | 3456 KB |
14.txt | AC | 9 ms | 3072 KB |
15.txt | AC | 9 ms | 2816 KB |
16.txt | AC | 10 ms | 2560 KB |
17.txt | AC | 9 ms | 2304 KB |
18.txt | AC | 10 ms | 2304 KB |
19.txt | AC | 11 ms | 2176 KB |
20.txt | AC | 11 ms | 2176 KB |
21.txt | AC | 5 ms | 1408 KB |
22.txt | AC | 5 ms | 1280 KB |
23.txt | AC | 6 ms | 1152 KB |
24.txt | AC | 6 ms | 1152 KB |
25.txt | AC | 6 ms | 1152 KB |
26.txt | AC | 7 ms | 1024 KB |
27.txt | AC | 7 ms | 1024 KB |
28.txt | AC | 7 ms | 1024 KB |
29.txt | AC | 8 ms | 1024 KB |
30.txt | AC | 8 ms | 1024 KB |
31.txt | AC | 8 ms | 1664 KB |
32.txt | AC | 7 ms | 1408 KB |
33.txt | AC | 7 ms | 1280 KB |
34.txt | AC | 7 ms | 1280 KB |
35.txt | AC | 7 ms | 1152 KB |
36.txt | AC | 6 ms | 1152 KB |
37.txt | AC | 6 ms | 1024 KB |
38.txt | AC | 6 ms | 1024 KB |
39.txt | AC | 6 ms | 1024 KB |
40.txt | AC | 5 ms | 1024 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 |