Submission #1591804
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define fill(x,y) memset(x,y,sizeof(x)) #define fi first #define se second #define sz(x) ((int) (x).size()) #define all(x) (x).begin(), (x).end() #define sqr(x) ((x) * (x)) #define sqrt(x) sqrt(abs(x)) #define mp make_pair #define pb push_back #define smp(x,y,z) mp(x,mp(y,z)) #define reads(x) scanf("%s",&x) #define read(x) scanf("%d",&x) #define read2(x,y) scanf("%d%d",&x,&y) #define read3(x,y,z) scanf("%d%d%d",&x,&y,&z) typedef long long ll; typedef string s; typedef pair<int,int> pii; typedef pair<int,string> pis; typedef pair<string,int> psi; typedef pair<string,string> pss; typedef vector<int> vi; typedef vector<vi> vvi; typedef vector<pii> vpii; typedef vector<vector<int> > matrix; const ll oo = 1e9+7; const int maxSize = 100100; const int mod = 1e9+7; const double EPS = (1e-9); int dcmp(double x, double y){return fabs(x-y) <= EPS ? 0 : x < y ? -1 : 1;} map<int,vi> seq; map<int,int> maxi; ll dfs(int n){ vi childss = seq[n] ; if(childss.empty())return 1; ll maxii = 0 ; for(int i : childss){ maxii=max(maxii,dfs(i)); } maxi[n] = max(maxii,(ll)childss.size()); return maxi[n]+1; } int main(){ int n ; cin >> n ; for(int i=2 ;i<=n ;i++){ int num ; cin >> num ; if(i!=num)seq[num].pb(i) ; } cout << dfs(1)-1 ; }
Submission Info
Submission Time | |
---|---|
Task | B - Tournament |
User | vjudge1 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1350 Byte |
Status | WA |
Exec Time | 125 ms |
Memory | 26880 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 | 125 ms | 12032 KB |
02.txt | WA | 124 ms | 12032 KB |
03.txt | WA | 125 ms | 12032 KB |
04.txt | WA | 125 ms | 12032 KB |
05.txt | AC | 125 ms | 12032 KB |
06.txt | WA | 125 ms | 12032 KB |
07.txt | AC | 124 ms | 12032 KB |
08.txt | AC | 125 ms | 12032 KB |
09.txt | AC | 125 ms | 12032 KB |
10.txt | WA | 125 ms | 12032 KB |
11.txt | AC | 97 ms | 26880 KB |
12.txt | AC | 94 ms | 21504 KB |
13.txt | AC | 86 ms | 19328 KB |
14.txt | AC | 76 ms | 17152 KB |
15.txt | AC | 78 ms | 15744 KB |
16.txt | AC | 77 ms | 14592 KB |
17.txt | WA | 78 ms | 13824 KB |
18.txt | AC | 82 ms | 13312 KB |
19.txt | WA | 98 ms | 13056 KB |
20.txt | AC | 98 ms | 13056 KB |
21.txt | AC | 42 ms | 8824 KB |
22.txt | AC | 38 ms | 8672 KB |
23.txt | AC | 37 ms | 8564 KB |
24.txt | AC | 37 ms | 8576 KB |
25.txt | AC | 38 ms | 8576 KB |
26.txt | AC | 40 ms | 8576 KB |
27.txt | AC | 44 ms | 8576 KB |
28.txt | AC | 51 ms | 8576 KB |
29.txt | AC | 62 ms | 8576 KB |
30.txt | AC | 70 ms | 8704 KB |
31.txt | WA | 88 ms | 11904 KB |
32.txt | WA | 70 ms | 10624 KB |
33.txt | WA | 69 ms | 9984 KB |
34.txt | WA | 67 ms | 9600 KB |
35.txt | WA | 55 ms | 9472 KB |
36.txt | WA | 49 ms | 8832 KB |
37.txt | WA | 43 ms | 8704 KB |
38.txt | WA | 39 ms | 8576 KB |
39.txt | WA | 37 ms | 8576 KB |
40.txt | WA | 36 ms | 8448 KB |
41.txt | WA | 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 | WA | 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 |