Submission #1754297


Source Code Expand

#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<stdlib.h>
using namespace std;
const long long mod=1000000007;
const long long inf=mod*mod;
vector<int>g[110000];
int dp[110000];
int v[110000];
int dfs(int a){
	if(g[a].size()==0){
		return dp[a]=0;
	}
	for(int i=0;i<g[a].size();i++){
		dfs(g[a][i]);
	}
	for(int i=0;i<g[a].size();i++){
		v[i]=dp[g[a][i]];
	}
	int n=g[a].size();
	std::sort(v,v+n);
	int ret=0;
	for(int i=0;i<n;i++){
		ret=max(ret,(i+1)+v[n-1-i]);
	}
	return dp[a]=ret;
}
int main(){
	int a;scanf("%d",&a);
	for(int i=0;i<a-1;i++){
		int p;scanf("%d",&p);p--;
		g[p].push_back(i+1);
	}
 
	int ret=dfs(0);
	printf("%d\n",ret);
}

Submission Info

Submission Time
Task B - Tournament
User tozangezan
Language C++14 (GCC 5.4.1)
Score 800
Code Size 799 Byte
Status AC
Exec Time 24 ms
Memory 12544 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:36:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  int a;scanf("%d",&a);
                      ^
./Main.cpp:38:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   int p;scanf("%d",&p);p--;
                       ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 800 / 800
Status
AC × 3
AC × 53
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 23 ms 4864 KB
02.txt AC 23 ms 4864 KB
03.txt AC 23 ms 4864 KB
04.txt AC 23 ms 4864 KB
05.txt AC 23 ms 4864 KB
06.txt AC 23 ms 4864 KB
07.txt AC 23 ms 4864 KB
08.txt AC 23 ms 4864 KB
09.txt AC 23 ms 4864 KB
10.txt AC 24 ms 4864 KB
11.txt AC 23 ms 12544 KB
12.txt AC 22 ms 9728 KB
13.txt AC 22 ms 8576 KB
14.txt AC 21 ms 7424 KB
15.txt AC 21 ms 6656 KB
16.txt AC 21 ms 6016 KB
17.txt AC 21 ms 5632 KB
18.txt AC 21 ms 5376 KB
19.txt AC 22 ms 5376 KB
20.txt AC 23 ms 5248 KB
21.txt AC 12 ms 4088 KB
22.txt AC 12 ms 3876 KB
23.txt AC 12 ms 3828 KB
24.txt AC 12 ms 3968 KB
25.txt AC 12 ms 3712 KB
26.txt AC 12 ms 3712 KB
27.txt AC 12 ms 3712 KB
28.txt AC 13 ms 3712 KB
29.txt AC 13 ms 3840 KB
30.txt AC 14 ms 3840 KB
31.txt AC 18 ms 4736 KB
32.txt AC 18 ms 4224 KB
33.txt AC 16 ms 3968 KB
34.txt AC 16 ms 3968 KB
35.txt AC 16 ms 4096 KB
36.txt AC 14 ms 3712 KB
37.txt AC 13 ms 3712 KB
38.txt AC 12 ms 3712 KB
39.txt AC 12 ms 3712 KB
40.txt AC 12 ms 3584 KB
41.txt AC 2 ms 2816 KB
42.txt AC 2 ms 2816 KB
43.txt AC 2 ms 2816 KB
44.txt AC 2 ms 2816 KB
45.txt AC 2 ms 2816 KB
46.txt AC 2 ms 2816 KB
47.txt AC 2 ms 2816 KB
48.txt AC 2 ms 2816 KB
49.txt AC 2 ms 2816 KB
50.txt AC 2 ms 2816 KB
s1.txt AC 2 ms 2816 KB
s2.txt AC 2 ms 2816 KB
s3.txt AC 2 ms 2816 KB