Submission #1075405
Source Code Expand
#include <cstdio> #include <algorithm> using namespace std; #define gc getchar() int read() { int x=0;char c=gc; for(;c<48||c>57;c=gc); for(;c>47&&c<58;c=gc) x*=10,x+=c-48; return x; } const int maxn=100050; int n,a[maxn],in[maxn],out[maxn]; int st[maxn],pv[maxn],p1[maxn],tot; inline void side(int u,int v) { pv[++tot]=v; p1[tot]=st[u]; st[u]=tot; ++in[u];++out[u]; } void init() { n=read(); for(int i=2;i<=n;++i) { a[i]=read(); side(a[i],i); } } int q[maxn],l=1,r,ans; int b[maxn],d[maxn],m; bool cmp(int a,int b){return a>b;} void getchild(int x) { m=1; for(int i=st[x];i;i=p1[i]) b[m++]=d[pv[i]]; sort(b+1,b+m,cmp); } void upd(int x) { if(!--out[x]) { getchild(x); for(int i=1;i<m;++i) d[x]=max(d[x],b[i]+i); } } void solve() { for(int i=1;i<=n;++i) if(!in[i]) { q[++r]=i; upd(a[i]); } while(l<=r) { int x=q[l++]; ans=max(ans,d[x]); if(!--in[a[x]]) { q[++r]=a[x]; upd(a[a[x]]); } } printf("%d\n",ans); } int main() { init(); solve(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Tournament |
User | enjoycallen |
Language | C++14 (GCC 5.4.1) |
Score | 800 |
Code Size | 1113 Byte |
Status | AC |
Exec Time | 17 ms |
Memory | 3328 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 | 16 ms | 3328 KB |
02.txt | AC | 16 ms | 3328 KB |
03.txt | AC | 16 ms | 3328 KB |
04.txt | AC | 16 ms | 3328 KB |
05.txt | AC | 16 ms | 3328 KB |
06.txt | AC | 16 ms | 3328 KB |
07.txt | AC | 16 ms | 3328 KB |
08.txt | AC | 17 ms | 3328 KB |
09.txt | AC | 16 ms | 3328 KB |
10.txt | AC | 16 ms | 3328 KB |
11.txt | AC | 12 ms | 3328 KB |
12.txt | AC | 13 ms | 3328 KB |
13.txt | AC | 13 ms | 3328 KB |
14.txt | AC | 13 ms | 3328 KB |
15.txt | AC | 14 ms | 3328 KB |
16.txt | AC | 14 ms | 3328 KB |
17.txt | AC | 14 ms | 3328 KB |
18.txt | AC | 14 ms | 3328 KB |
19.txt | AC | 14 ms | 3328 KB |
20.txt | AC | 15 ms | 3328 KB |
21.txt | AC | 9 ms | 2176 KB |
22.txt | AC | 8 ms | 1920 KB |
23.txt | AC | 8 ms | 1920 KB |
24.txt | AC | 8 ms | 1792 KB |
25.txt | AC | 8 ms | 1792 KB |
26.txt | AC | 9 ms | 1792 KB |
27.txt | AC | 9 ms | 1792 KB |
28.txt | AC | 9 ms | 1792 KB |
29.txt | AC | 9 ms | 1792 KB |
30.txt | AC | 10 ms | 1792 KB |
31.txt | AC | 10 ms | 2560 KB |
32.txt | AC | 10 ms | 2304 KB |
33.txt | AC | 9 ms | 2176 KB |
34.txt | AC | 9 ms | 2048 KB |
35.txt | AC | 9 ms | 1920 KB |
36.txt | AC | 8 ms | 1792 KB |
37.txt | AC | 8 ms | 1792 KB |
38.txt | AC | 8 ms | 1792 KB |
39.txt | AC | 8 ms | 1792 KB |
40.txt | AC | 8 ms | 1792 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 | 128 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 |