Submission #1819533
Source Code Expand
#include <cstdio> #include <cstdlib> #include <cstring> #include <cctype> #include <cmath> #include <algorithm> #include <functional> #define rep(i, a, b) for (int i = (a), _ = (b); i <= _; ++ i) #define per(i, a, b) for (int i = (a), _ = (b); i >= _; -- i) #define For(i, a, b) for (int i = (a), _ = (b); i < _; ++ i) #define fore(e, u, v) for (int p = e(u), v = e[p].y; p; v = e[p = e[p].nxt].y) #define ri rd<int> using namespace std; const int maxN = 1e5 + 7; template<class T> inline T rd() { bool f = 1; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == '-') f = 0; T x = 0; for (; isdigit(c); c = getchar()) x = x * 10 + c - 48; return f ? x : -x; } int n; struct vec { static const int maxE = maxN; int g[maxN], te; struct edge {int y, nxt;} e[maxE << 1]; inline void push(int x, int y) {e[++te] = (edge){y, g[x]}; g[x] = te;} inline void link(int x, int y) {push(x, y), push(y, x);} inline int& operator () (int x) {return g[x];} inline edge& operator [] (int x) {return e[x];} }e; int depth[maxN]; int d[maxN], tt; void dfs(int x) { fore (e, x, y) dfs(y); tt = 0; fore (e, x, y) d[++tt] = depth[y]; sort(d+1, d+tt+1, greater<int>()); depth[x] = 0; rep (i, 1, tt) depth[x] = max(depth[x], d[i] + i); } int main() { n = ri(); rep (i, 2, n) e.push(ri(), i); dfs(1); printf("%d\n", depth[1]); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Tournament |
User | acha |
Language | C++14 (GCC 5.4.1) |
Score | 800 |
Code Size | 1400 Byte |
Status | AC |
Exec Time | 10 ms |
Memory | 4864 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 | 10 ms | 1792 KB |
02.txt | AC | 10 ms | 1792 KB |
03.txt | AC | 10 ms | 1792 KB |
04.txt | AC | 10 ms | 1792 KB |
05.txt | AC | 10 ms | 1792 KB |
06.txt | AC | 10 ms | 1792 KB |
07.txt | AC | 10 ms | 1792 KB |
08.txt | AC | 10 ms | 1792 KB |
09.txt | AC | 10 ms | 1792 KB |
10.txt | AC | 10 ms | 1792 KB |
11.txt | AC | 9 ms | 4864 KB |
12.txt | AC | 9 ms | 3840 KB |
13.txt | AC | 8 ms | 3328 KB |
14.txt | AC | 8 ms | 2816 KB |
15.txt | AC | 8 ms | 2432 KB |
16.txt | AC | 8 ms | 2176 KB |
17.txt | AC | 8 ms | 1920 KB |
18.txt | AC | 8 ms | 1792 KB |
19.txt | AC | 9 ms | 1792 KB |
20.txt | AC | 9 ms | 1792 KB |
21.txt | AC | 5 ms | 1792 KB |
22.txt | AC | 5 ms | 1536 KB |
23.txt | AC | 5 ms | 1408 KB |
24.txt | AC | 5 ms | 1408 KB |
25.txt | AC | 5 ms | 1408 KB |
26.txt | AC | 6 ms | 1408 KB |
27.txt | AC | 7 ms | 1408 KB |
28.txt | AC | 7 ms | 1408 KB |
29.txt | AC | 7 ms | 1280 KB |
30.txt | AC | 7 ms | 1408 KB |
31.txt | AC | 7 ms | 1536 KB |
32.txt | AC | 6 ms | 1536 KB |
33.txt | AC | 6 ms | 1408 KB |
34.txt | AC | 6 ms | 1408 KB |
35.txt | AC | 6 ms | 1408 KB |
36.txt | AC | 6 ms | 1408 KB |
37.txt | AC | 6 ms | 1408 KB |
38.txt | AC | 5 ms | 1408 KB |
39.txt | AC | 5 ms | 1408 KB |
40.txt | AC | 5 ms | 1408 KB |
41.txt | AC | 1 ms | 128 KB |
42.txt | AC | 1 ms | 128 KB |
43.txt | AC | 1 ms | 128 KB |
44.txt | AC | 1 ms | 128 KB |
45.txt | AC | 1 ms | 128 KB |
46.txt | AC | 1 ms | 128 KB |
47.txt | AC | 1 ms | 128 KB |
48.txt | AC | 1 ms | 128 KB |
49.txt | AC | 1 ms | 128 KB |
50.txt | AC | 1 ms | 128 KB |
s1.txt | AC | 1 ms | 128 KB |
s2.txt | AC | 1 ms | 128 KB |
s3.txt | AC | 1 ms | 128 KB |