Submission #1653995
Source Code Expand
#include<iostream> #include<cstring> #include<cstdio> #include<algorithm> #include<cmath> #include<set> #include<bitset> #include<map> #define fo(i,a,b) for(int i=a;i<=b;i++) #define fd(i,a,b) for(int i=a;i>=b;i--) using namespace std; typedef long long LL; typedef double db; int get(){ char ch; while(ch=getchar(),(ch<'0'||ch>'9')&&ch!='-'); if (ch=='-'){ int s=0; while(ch=getchar(),ch>='0'&&ch<='9')s=s*10+ch-'0'; return -s; } int s=ch-'0'; while(ch=getchar(),ch>='0'&&ch<='9')s=s*10+ch-'0'; return s; } const int N = 1e+5+5; int f[N]; struct edge{ int x,nxt; }e[N]; int h[N],tot; int n; void inse(int x,int y){ e[++tot].x=y; e[tot].nxt=h[x]; h[x]=tot; } int t[N],k; void dfs(int x){ for(int p=h[x];p;p=e[p].nxt)dfs(e[p].x); k=0; for(int p=h[x];p;p=e[p].nxt)t[++k]=f[e[p].x]; sort(t+1,t+1+k); fo(i,1,k)f[x]=max(f[x],t[i]+k-i+1); } int main(){ n=get(); fo(i,2,n){ int x=get(); inse(x,i); } dfs(1); printf("%d\n",f[1]); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Tournament |
User | samjia2000 |
Language | C++14 (GCC 5.4.1) |
Score | 800 |
Code Size | 1039 Byte |
Status | AC |
Exec Time | 11 ms |
Memory | 4992 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 | 11 ms | 1792 KB |
02.txt | AC | 11 ms | 1792 KB |
03.txt | AC | 11 ms | 1792 KB |
04.txt | AC | 11 ms | 1792 KB |
05.txt | AC | 11 ms | 1792 KB |
06.txt | AC | 11 ms | 1792 KB |
07.txt | AC | 11 ms | 1792 KB |
08.txt | AC | 10 ms | 1792 KB |
09.txt | AC | 11 ms | 1792 KB |
10.txt | AC | 11 ms | 1792 KB |
11.txt | AC | 10 ms | 4992 KB |
12.txt | AC | 10 ms | 3840 KB |
13.txt | AC | 10 ms | 3328 KB |
14.txt | AC | 9 ms | 2816 KB |
15.txt | AC | 9 ms | 2560 KB |
16.txt | AC | 9 ms | 2176 KB |
17.txt | AC | 9 ms | 2048 KB |
18.txt | AC | 9 ms | 1920 KB |
19.txt | AC | 10 ms | 1792 KB |
20.txt | AC | 11 ms | 1792 KB |
21.txt | AC | 5 ms | 1408 KB |
22.txt | AC | 5 ms | 1280 KB |
23.txt | AC | 5 ms | 1152 KB |
24.txt | AC | 5 ms | 1152 KB |
25.txt | AC | 5 ms | 1024 KB |
26.txt | AC | 6 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 | 1408 KB |
32.txt | AC | 7 ms | 1280 KB |
33.txt | AC | 7 ms | 1280 KB |
34.txt | AC | 7 ms | 1152 KB |
35.txt | AC | 7 ms | 1152 KB |
36.txt | AC | 7 ms | 1024 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 |