Submission #1239858
Source Code Expand
#include<cstdio> #include<cstring> #include<vector> #include<queue> #include<algorithm> #include<cmath> #include<climits> #include<string> #include<numeric> #include<set> #include<map> #include<iostream> using namespace std; #define rep(i,n) for(int i = 0;i<((int)(n));i++) #define reg(i,a,b) for(lli i = ((int)(a));i<=((int)(b));i++) #define irep(i,n) for(int i = ((int)(n)-1);i>=0;i--) #define ireg(i,a,b) for(int i = ((int)(b));i>=((int)(a));i--) typedef long long int lli; typedef pair<int, int> mp; #define fir first #define sec second #define IINF INT_MAX #define LINF LLONG_MAX #define eprintf(...) fprintf(stderr,__VA_ARGS__) #define pque(type) priority_queue<type,vector<type>,greater<type> > #define memst(a,b) memset(a,b,sizeof(a)) vector<vector<int>> v; int dfs(int m){ vector<int> t; rep(i, v[m].size()) t.push_back(dfs(v[m][i])); sort(t.rbegin(), t.rend()); rep(i, t.size()) t[i] += i + 1; if(t.size() != 0) return *(max_element(t.begin(), t.end())); else return 0; } int main(void){ int n; cin >> n; v.resize(n); reg(i, 1, n-1){ int t; cin >> t; t--; v[t].push_back(i); } cout << dfs(0) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Tournament |
User | ktyshmt |
Language | C++14 (GCC 5.4.1) |
Score | 800 |
Code Size | 1195 Byte |
Status | AC |
Exec Time | 46 ms |
Memory | 15104 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 | 45 ms | 4224 KB |
02.txt | AC | 45 ms | 4224 KB |
03.txt | AC | 43 ms | 4224 KB |
04.txt | AC | 45 ms | 4224 KB |
05.txt | AC | 45 ms | 4224 KB |
06.txt | AC | 45 ms | 4224 KB |
07.txt | AC | 45 ms | 4224 KB |
08.txt | AC | 45 ms | 4224 KB |
09.txt | AC | 45 ms | 4224 KB |
10.txt | AC | 45 ms | 4224 KB |
11.txt | AC | 45 ms | 15104 KB |
12.txt | AC | 45 ms | 11648 KB |
13.txt | AC | 45 ms | 9984 KB |
14.txt | AC | 44 ms | 8192 KB |
15.txt | AC | 44 ms | 6912 KB |
16.txt | AC | 44 ms | 5888 KB |
17.txt | AC | 44 ms | 5248 KB |
18.txt | AC | 43 ms | 4736 KB |
19.txt | AC | 46 ms | 4608 KB |
20.txt | AC | 46 ms | 4608 KB |
21.txt | AC | 21 ms | 3704 KB |
22.txt | AC | 20 ms | 3424 KB |
23.txt | AC | 20 ms | 3316 KB |
24.txt | AC | 20 ms | 3376 KB |
25.txt | AC | 20 ms | 3200 KB |
26.txt | AC | 21 ms | 3072 KB |
27.txt | AC | 22 ms | 3200 KB |
28.txt | AC | 23 ms | 3200 KB |
29.txt | AC | 26 ms | 3200 KB |
30.txt | AC | 27 ms | 3200 KB |
31.txt | AC | 40 ms | 4096 KB |
32.txt | AC | 40 ms | 3584 KB |
33.txt | AC | 37 ms | 3328 KB |
34.txt | AC | 37 ms | 3328 KB |
35.txt | AC | 35 ms | 3456 KB |
36.txt | AC | 31 ms | 3072 KB |
37.txt | AC | 29 ms | 3072 KB |
38.txt | AC | 26 ms | 3072 KB |
39.txt | AC | 24 ms | 3072 KB |
40.txt | AC | 22 ms | 2944 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 | 256 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 |