Submission #1584296
Source Code Expand
#include <bits/stdc++.h> #define INF_MAX 2147483647 #define INF_MIN -2147483647 #define INF_LL 2000000000000000000LL #define INF 1000000000 #define EPS 1e-8 #define LL long long #define mod 1000000007 #define pb push_back #define mp make_pair #define f first #define s second #define setzero(a) memset(a,0,sizeof(a)) #define setdp(a) memset(a,-1,sizeof(a)) #define bits(a) __builtin_popcount(a) using namespace std; vector<int> nxt[100005]; int solve(int ind) { int ans = 0; vector<int> v; for (int x : nxt[ind]) { v.pb(solve(x)); } sort(v.begin(), v.end(), greater<int>()); for (int i=0;i<v.size();i++) { ans = max(ans, v[i] + i + 1); } return ans; } int main() { int n, x; cin >> n; for (int i=1;i<n;i++) { scanf("%d", &x); nxt[x-1].pb(i); } cout << solve(0); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Tournament |
User | AmrMahmoud |
Language | C++14 (GCC 5.4.1) |
Score | 800 |
Code Size | 843 Byte |
Status | AC |
Exec Time | 28 ms |
Memory | 13568 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:39:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &x); ^
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 | 26 ms | 4224 KB |
02.txt | AC | 27 ms | 4224 KB |
03.txt | AC | 26 ms | 4224 KB |
04.txt | AC | 26 ms | 4224 KB |
05.txt | AC | 26 ms | 4224 KB |
06.txt | AC | 26 ms | 4224 KB |
07.txt | AC | 26 ms | 4224 KB |
08.txt | AC | 26 ms | 4224 KB |
09.txt | AC | 26 ms | 4224 KB |
10.txt | AC | 26 ms | 4224 KB |
11.txt | AC | 26 ms | 13568 KB |
12.txt | AC | 28 ms | 10624 KB |
13.txt | AC | 25 ms | 9216 KB |
14.txt | AC | 25 ms | 7680 KB |
15.txt | AC | 24 ms | 6656 KB |
16.txt | AC | 24 ms | 5760 KB |
17.txt | AC | 24 ms | 5120 KB |
18.txt | AC | 25 ms | 4736 KB |
19.txt | AC | 25 ms | 4608 KB |
20.txt | AC | 25 ms | 4608 KB |
21.txt | AC | 12 ms | 3704 KB |
22.txt | AC | 12 ms | 3424 KB |
23.txt | AC | 12 ms | 3316 KB |
24.txt | AC | 12 ms | 3376 KB |
25.txt | AC | 11 ms | 3200 KB |
26.txt | AC | 12 ms | 3072 KB |
27.txt | AC | 12 ms | 3200 KB |
28.txt | AC | 12 ms | 3200 KB |
29.txt | AC | 13 ms | 3200 KB |
30.txt | AC | 13 ms | 3200 KB |
31.txt | AC | 22 ms | 4096 KB |
32.txt | AC | 21 ms | 3584 KB |
33.txt | AC | 19 ms | 3328 KB |
34.txt | AC | 19 ms | 3328 KB |
35.txt | AC | 18 ms | 3456 KB |
36.txt | AC | 15 ms | 3072 KB |
37.txt | AC | 14 ms | 3072 KB |
38.txt | AC | 13 ms | 3072 KB |
39.txt | AC | 12 ms | 3072 KB |
40.txt | AC | 12 ms | 2944 KB |
41.txt | AC | 2 ms | 2560 KB |
42.txt | AC | 2 ms | 2560 KB |
43.txt | AC | 2 ms | 2560 KB |
44.txt | AC | 2 ms | 2560 KB |
45.txt | AC | 2 ms | 2560 KB |
46.txt | AC | 2 ms | 2560 KB |
47.txt | AC | 2 ms | 2560 KB |
48.txt | AC | 2 ms | 2560 KB |
49.txt | AC | 2 ms | 2560 KB |
50.txt | AC | 2 ms | 2560 KB |
s1.txt | AC | 2 ms | 2560 KB |
s2.txt | AC | 2 ms | 2560 KB |
s3.txt | AC | 2 ms | 2560 KB |