Submission #1073897


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define RFOR(i,b,a) for (int i = (b)-1; i >= (a); i--)
#define ITER(it,a) for (__typeof(a.begin()) it = a.begin(); it != a.end(); it++)
#define FILL(a,value) memset(a, value, sizeof(a))

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define MP make_pair
#define PB push_back

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;

const double PI = acos(-1.0);
const int INF = 1000 * 1000 * 1000 + 7;
const LL LINF = INF * (LL)INF;

const int MAX = 100100;
int A[MAX];
vector<int> g[MAX];

int get(int x)
{
	if (SZ(g[x]) == 0) return 0;
	vector<int> a;
	FOR (i, 0, SZ(g[x]))
	{
		int to = g[x][i];
		a.PB(get(to));
	}

	sort(ALL(a));
	reverse(ALL(a));

	int res = -INF;
	int d = 1;
	FOR (i, 0, SZ(a))
	{
		res = max(res, a[i] + d);
		d++;
	}

	return res;
}

int main()
{
	//freopen("in.txt", "r", stdin);
	//ios::sync_with_stdio(false); cin.tie(0);

	int n;
	scanf("%d", &n);
	FOR (i, 1, n)
	{
		scanf("%d", &A[i]);
		A[i]--;
		g[A[i]].PB(i);
	}

	cout<<get(0)<<endl;

}

Submission Info

Submission Time
Task B - Tournament
User Andrew_Makar
Language C++14 (GCC 5.4.1)
Score 800
Code Size 1172 Byte
Status AC
Exec Time 38 ms
Memory 15488 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:56:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
./Main.cpp:59:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &A[i]);
                     ^

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 31 ms 4608 KB
02.txt AC 31 ms 4608 KB
03.txt AC 32 ms 4608 KB
04.txt AC 32 ms 4736 KB
05.txt AC 31 ms 4608 KB
06.txt AC 32 ms 4608 KB
07.txt AC 38 ms 4608 KB
08.txt AC 31 ms 4608 KB
09.txt AC 31 ms 4608 KB
10.txt AC 31 ms 4608 KB
11.txt AC 38 ms 15488 KB
12.txt AC 36 ms 12032 KB
13.txt AC 35 ms 10368 KB
14.txt AC 33 ms 8576 KB
15.txt AC 32 ms 7296 KB
16.txt AC 32 ms 6272 KB
17.txt AC 30 ms 5632 KB
18.txt AC 30 ms 5120 KB
19.txt AC 30 ms 4992 KB
20.txt AC 31 ms 4992 KB
21.txt AC 16 ms 4088 KB
22.txt AC 16 ms 3808 KB
23.txt AC 16 ms 3820 KB
24.txt AC 16 ms 3760 KB
25.txt AC 15 ms 3584 KB
26.txt AC 15 ms 3456 KB
27.txt AC 16 ms 3584 KB
28.txt AC 16 ms 3584 KB
29.txt AC 17 ms 3584 KB
30.txt AC 17 ms 3584 KB
31.txt AC 26 ms 4480 KB
32.txt AC 25 ms 3968 KB
33.txt AC 23 ms 3712 KB
34.txt AC 23 ms 3712 KB
35.txt AC 22 ms 3840 KB
36.txt AC 19 ms 3456 KB
37.txt AC 18 ms 3456 KB
38.txt AC 17 ms 3456 KB
39.txt AC 16 ms 3456 KB
40.txt AC 15 ms 3328 KB
41.txt AC 5 ms 2560 KB
42.txt AC 5 ms 2560 KB
43.txt AC 5 ms 2560 KB
44.txt AC 5 ms 2560 KB
45.txt AC 5 ms 2560 KB
46.txt AC 5 ms 2560 KB
47.txt AC 5 ms 2560 KB
48.txt AC 5 ms 2560 KB
49.txt AC 5 ms 2560 KB
50.txt AC 5 ms 2560 KB
s1.txt AC 5 ms 2560 KB
s2.txt AC 5 ms 2560 KB
s3.txt AC 5 ms 2560 KB