Submission #1287839
Source Code Expand
#define _CRT_SECURE_NO_WARNINGS #include <algorithm> #include <array> #include <cstdio> using namespace std; const int INF = 100000; int N; int D; int C; array<int, INF> S; array<int, INF> I; array<int, INF> Dp; struct L { int v; int n; }; array<L, INF> E; void Link(int u, int v) { E[++D] = { v, S[u] }; S[u] = D; } // descending bool Cmp(int a, int b) { return Dp[a] > Dp[b]; } void DFS(int u) { for (int i = S[u]; i; i = E[i].n) { DFS(E[i].v); } int a = 0; for (int i = S[u]; i; i = E[i].n) { I[++a] = E[i].v; } sort(&I[0] + 1, &I[0] + a + 1, Cmp); for (int i = 1; i <= a; i++) { Dp[u] = max(Dp[u], Dp[I[i]] + i); } } template<class T> void gc(T &x) { char c; int s = 0; x = 0; c = getchar_unlocked(); if (c == '-') s = 1; else if ('0' <= c && c <= '9') x = c - '0'; while (true) { c = getchar_unlocked(); if (c < '0' || c > '9') break; x = x * 10 + (c - '0'); } if (s) x = -x; } int main() { gc(N); int x; for (int i = 2; i <= N; i++) { gc(x); Link(x, i); } DFS(1); printf("%d\n", Dp[1]); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Tournament |
User | ShinjiSHIBATA |
Language | C++14 (GCC 5.4.1) |
Score | 800 |
Code Size | 1325 Byte |
Status | AC |
Exec Time | 7 ms |
Memory | 6400 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 | 7 ms | 1792 KB |
02.txt | AC | 7 ms | 1664 KB |
03.txt | AC | 7 ms | 1664 KB |
04.txt | AC | 7 ms | 1664 KB |
05.txt | AC | 7 ms | 1664 KB |
06.txt | AC | 7 ms | 1664 KB |
07.txt | AC | 7 ms | 1664 KB |
08.txt | AC | 7 ms | 1792 KB |
09.txt | AC | 7 ms | 1664 KB |
10.txt | AC | 7 ms | 1664 KB |
11.txt | AC | 7 ms | 6400 KB |
12.txt | AC | 6 ms | 4864 KB |
13.txt | AC | 6 ms | 4096 KB |
14.txt | AC | 6 ms | 3328 KB |
15.txt | AC | 6 ms | 2944 KB |
16.txt | AC | 6 ms | 2304 KB |
17.txt | AC | 5 ms | 2048 KB |
18.txt | AC | 6 ms | 1792 KB |
19.txt | AC | 6 ms | 1792 KB |
20.txt | AC | 7 ms | 1792 KB |
21.txt | AC | 6 ms | 1280 KB |
22.txt | AC | 5 ms | 1152 KB |
23.txt | AC | 5 ms | 1024 KB |
24.txt | AC | 5 ms | 1024 KB |
25.txt | AC | 5 ms | 1024 KB |
26.txt | AC | 6 ms | 1024 KB |
27.txt | AC | 6 ms | 1024 KB |
28.txt | AC | 6 ms | 896 KB |
29.txt | AC | 6 ms | 896 KB |
30.txt | AC | 5 ms | 896 KB |
31.txt | AC | 4 ms | 1280 KB |
32.txt | AC | 4 ms | 1152 KB |
33.txt | AC | 4 ms | 1152 KB |
34.txt | AC | 4 ms | 1024 KB |
35.txt | AC | 4 ms | 1024 KB |
36.txt | AC | 4 ms | 1024 KB |
37.txt | AC | 4 ms | 1024 KB |
38.txt | AC | 4 ms | 896 KB |
39.txt | AC | 4 ms | 896 KB |
40.txt | AC | 4 ms | 896 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 | 0 ms | 128 KB |
45.txt | AC | 1 ms | 128 KB |
46.txt | AC | 1 ms | 128 KB |
47.txt | AC | 0 ms | 128 KB |
48.txt | AC | 0 ms | 128 KB |
49.txt | AC | 0 ms | 128 KB |
50.txt | AC | 1 ms | 128 KB |
s1.txt | AC | 0 ms | 128 KB |
s2.txt | AC | 1 ms | 128 KB |
s3.txt | AC | 1 ms | 128 KB |