Submission #1074178
Source Code Expand
//============================================================================ // Author : Sun YaoFeng //============================================================================ //#pragma comment(linker, "/STACK:100240000,100240000") //#include <cstdio> //#include <cstdlib> //#include <cstring> //#include <algorithm> #include <bits/stdc++.h> using namespace std; #define DB double #define lf else if #define I64 long long #define Rd() (rand()<<15|rand()) #define For(i,a,b) for(int i=a,lim=b;i<=lim;i++) #define Rep(i,a,b) for(int i=a,lim=b;i>=lim;i--) #define fi first #define se second #define MK make_pair #define PA pair<int, int> //#define min(a,b) ((a)<(b)?(a):(b)) //#define max(a,b) ((a)<(b)?(b):(a)) #define CH (ch=getchar()) int IN() { int x= 0, f= 0, ch; for (; CH < '0' || ch > '9';) f= (ch == '-'); for (; ch >= '0' && ch <= '9'; CH) x= x*10 + ch -'0'; return f? -x : x; } #define n 100005 int N, D, C, st[n], ID[n], Dep[n]; struct Lin{ int v, next; }E[n]; void Link(int u, int v) { E[++ D]= (Lin){v, st[u]}; st[u]= D; } bool Cmp(int a, int b) { return Dep[a] > Dep[b]; } void DFS(int u) { for (int i= st[u]; i; i= E[i].next) DFS(E[i].v); C= 0; for (int i= st[u]; i; i= E[i].next) ID[++ C]= E[i].v; sort(ID+1, ID+C+1, Cmp); For(i, 1, C) Dep[u]= max(Dep[u], Dep[ID[i]] + i); } int main(int argc, char* argv[]){ N= IN(); For(i, 2, N) Link(IN(), i); DFS(1); printf("%d\n", Dep[1]); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Tournament |
User | s1451900 |
Language | C++14 (GCC 5.4.1) |
Score | 800 |
Code Size | 1553 Byte |
Status | AC |
Exec Time | 15 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 | 14 ms | 1792 KB |
02.txt | AC | 14 ms | 1792 KB |
03.txt | AC | 14 ms | 1792 KB |
04.txt | AC | 14 ms | 1792 KB |
05.txt | AC | 14 ms | 1792 KB |
06.txt | AC | 14 ms | 1792 KB |
07.txt | AC | 14 ms | 1792 KB |
08.txt | AC | 14 ms | 1792 KB |
09.txt | AC | 14 ms | 1792 KB |
10.txt | AC | 14 ms | 1792 KB |
11.txt | AC | 15 ms | 4992 KB |
12.txt | AC | 14 ms | 3840 KB |
13.txt | AC | 13 ms | 3328 KB |
14.txt | AC | 13 ms | 2816 KB |
15.txt | AC | 12 ms | 2560 KB |
16.txt | AC | 12 ms | 2176 KB |
17.txt | AC | 12 ms | 2048 KB |
18.txt | AC | 12 ms | 1920 KB |
19.txt | AC | 13 ms | 1792 KB |
20.txt | AC | 13 ms | 1792 KB |
21.txt | AC | 9 ms | 1408 KB |
22.txt | AC | 9 ms | 1280 KB |
23.txt | AC | 9 ms | 1152 KB |
24.txt | AC | 9 ms | 1152 KB |
25.txt | AC | 9 ms | 1024 KB |
26.txt | AC | 10 ms | 1024 KB |
27.txt | AC | 10 ms | 1024 KB |
28.txt | AC | 10 ms | 1024 KB |
29.txt | AC | 10 ms | 1024 KB |
30.txt | AC | 10 ms | 1024 KB |
31.txt | AC | 10 ms | 1408 KB |
32.txt | AC | 10 ms | 1280 KB |
33.txt | AC | 10 ms | 1280 KB |
34.txt | AC | 9 ms | 1152 KB |
35.txt | AC | 9 ms | 1152 KB |
36.txt | AC | 9 ms | 1024 KB |
37.txt | AC | 9 ms | 1024 KB |
38.txt | AC | 8 ms | 1024 KB |
39.txt | AC | 9 ms | 1024 KB |
40.txt | AC | 8 ms | 1024 KB |
41.txt | AC | 3 ms | 256 KB |
42.txt | AC | 3 ms | 256 KB |
43.txt | AC | 3 ms | 256 KB |
44.txt | AC | 3 ms | 256 KB |
45.txt | AC | 3 ms | 256 KB |
46.txt | AC | 3 ms | 256 KB |
47.txt | AC | 3 ms | 256 KB |
48.txt | AC | 3 ms | 256 KB |
49.txt | AC | 3 ms | 256 KB |
50.txt | AC | 3 ms | 256 KB |
s1.txt | AC | 3 ms | 256 KB |
s2.txt | AC | 3 ms | 256 KB |
s3.txt | AC | 3 ms | 256 KB |