Submission #1073860


Source Code Expand

#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define FILL(a,x) memset(a,x,sizeof(a))
#define foreach( gg,ii ) for( typeof(gg.begin()) ii=gg.begin();ii!=gg.end();ii++)
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define sz(a) int((a).size())
#define N 1000010
#define MAX 30
#define mod 1000000007
#define REP(i,a) for(int i=0;i<a;++i)
#define REPP(i,a,b) for(int i=a;i<b;++i)
#define all(a) a.begin(),a.end()
const ll INF = 1e18+1;

ll a[N];
vector <ll> G[N];

int dfs(int v){
	int w,z=0;
	vector <int> x;
	REP(i,sz(G[v])){
		w=G[v][i];
		x.pb(dfs(w));
	}
	sort(all(x),greater<int>());
	REP(i,sz(x)){
		x[i]+=(i+1);
		z=max(z,x[i]);
	}
	return z;
}

int main()
{
	ll n,x=0,y;
	scanf("%lld",&n);
	REP(i,n-1){
		scanf("%lld",&x);
		x--;
		G[x].pb(i+1);
	}
	printf("%d\n",dfs(0));
return 0;
}

Submission Info

Submission Time
Task B - Tournament
User TerryMcGinnis
Language C++14 (GCC 5.4.1)
Score 800
Code Size 995 Byte
Status AC
Exec Time 60 ms
Memory 36224 KiB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:44:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld",&n);
                  ^
./Main.cpp:46:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld",&x);
                   ^

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 55 ms 25600 KiB
02.txt AC 54 ms 25600 KiB
03.txt AC 54 ms 25600 KiB
04.txt AC 55 ms 25600 KiB
05.txt AC 55 ms 25600 KiB
06.txt AC 55 ms 25600 KiB
07.txt AC 57 ms 25600 KiB
08.txt AC 56 ms 25600 KiB
09.txt AC 55 ms 25600 KiB
10.txt AC 55 ms 25600 KiB
11.txt AC 60 ms 36224 KiB
12.txt AC 57 ms 32768 KiB
13.txt AC 56 ms 31104 KiB
14.txt AC 55 ms 29312 KiB
15.txt AC 54 ms 28160 KiB
16.txt AC 52 ms 27136 KiB
17.txt AC 52 ms 26496 KiB
18.txt AC 52 ms 25984 KiB
19.txt AC 53 ms 25856 KiB
20.txt AC 54 ms 25856 KiB
21.txt AC 40 ms 25332 KiB
22.txt AC 39 ms 24948 KiB
23.txt AC 39 ms 24948 KiB
24.txt AC 39 ms 24780 KiB
25.txt AC 38 ms 24832 KiB
26.txt AC 38 ms 24704 KiB
27.txt AC 38 ms 24704 KiB
28.txt AC 39 ms 24704 KiB
29.txt AC 41 ms 24960 KiB
30.txt AC 40 ms 24832 KiB
31.txt AC 48 ms 25216 KiB
32.txt AC 48 ms 25216 KiB
33.txt AC 45 ms 24832 KiB
34.txt AC 45 ms 24960 KiB
35.txt AC 47 ms 25216 KiB
36.txt AC 42 ms 24576 KiB
37.txt AC 41 ms 24576 KiB
38.txt AC 40 ms 24704 KiB
39.txt AC 39 ms 24704 KiB
40.txt AC 38 ms 24448 KiB
41.txt AC 27 ms 23680 KiB
42.txt AC 27 ms 23680 KiB
43.txt AC 27 ms 23680 KiB
44.txt AC 27 ms 23680 KiB
45.txt AC 27 ms 23680 KiB
46.txt AC 27 ms 23680 KiB
47.txt AC 27 ms 23680 KiB
48.txt AC 27 ms 23680 KiB
49.txt AC 27 ms 23680 KiB
50.txt AC 27 ms 23680 KiB
s1.txt AC 27 ms 23680 KiB
s2.txt AC 27 ms 23680 KiB
s3.txt AC 27 ms 23680 KiB