Submission #1074390
Source Code Expand
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> Beaten(n); vector<int> Beats(n); vector<int> H(n); for(int i = 1; i < n; ++i) { cin >> Beaten[i]; Beaten[i] -= 1; Beats[Beaten[i]] += 1; } cerr << "OK" << endl; auto cmp = [&](int a, int b) { return H[a] < H[b]; }; priority_queue<int, vector<int>, decltype(cmp)> Q(cmp); for(int i = 0; i < n; ++i) { if(Beats[i] == 0) { Q.push(i); } } for(int i = 1; i < n; ++i) { int top = Q.top(); Q.pop(); int par = Beaten[top]; if(H[par] < H[top]) H[par] = H[top]; H[par] += 1; if(--Beats[par] == 0) Q.push(par); } assert(Beats[0] == 0); assert(Q.top() == 0); for(int i = 1; i < n; ++i) assert(H[0] > H[i]); cout << H[0] << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Tournament |
User | retrograd |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 843 Byte |
Status | WA |
Exec Time | 44 ms |
Memory | 2172 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 43 ms | 1792 KB |
02.txt | WA | 43 ms | 1792 KB |
03.txt | WA | 44 ms | 1792 KB |
04.txt | WA | 43 ms | 1792 KB |
05.txt | WA | 43 ms | 1792 KB |
06.txt | WA | 43 ms | 1792 KB |
07.txt | WA | 43 ms | 1792 KB |
08.txt | WA | 43 ms | 1792 KB |
09.txt | WA | 43 ms | 1792 KB |
10.txt | WA | 43 ms | 1792 KB |
11.txt | AC | 33 ms | 1408 KB |
12.txt | WA | 36 ms | 1664 KB |
13.txt | WA | 38 ms | 1664 KB |
14.txt | WA | 40 ms | 1664 KB |
15.txt | WA | 41 ms | 1792 KB |
16.txt | WA | 42 ms | 1792 KB |
17.txt | WA | 42 ms | 1792 KB |
18.txt | WA | 42 ms | 1792 KB |
19.txt | WA | 43 ms | 1792 KB |
20.txt | AC | 43 ms | 1792 KB |
21.txt | AC | 34 ms | 2044 KB |
22.txt | WA | 35 ms | 2044 KB |
23.txt | WA | 35 ms | 2044 KB |
24.txt | WA | 34 ms | 2044 KB |
25.txt | AC | 34 ms | 2172 KB |
26.txt | WA | 32 ms | 2044 KB |
27.txt | WA | 33 ms | 2044 KB |
28.txt | WA | 33 ms | 2044 KB |
29.txt | WA | 35 ms | 2044 KB |
30.txt | WA | 36 ms | 2044 KB |
31.txt | WA | 42 ms | 1792 KB |
32.txt | WA | 42 ms | 2044 KB |
33.txt | WA | 41 ms | 2044 KB |
34.txt | WA | 40 ms | 2044 KB |
35.txt | WA | 39 ms | 2044 KB |
36.txt | WA | 38 ms | 2044 KB |
37.txt | WA | 39 ms | 2044 KB |
38.txt | WA | 36 ms | 2044 KB |
39.txt | WA | 34 ms | 2044 KB |
40.txt | WA | 32 ms | 2044 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 | WA | 3 ms | 256 KB |
s3.txt | AC | 3 ms | 256 KB |