Submission #2073266


Source Code Expand

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<queue>
#define mp(x,y) make_pair(x,y)
using namespace std;

const int N=100005;

int n,a[N],deg[N],f[N];
priority_queue<pair<int,int> > que;

int main()
{
    scanf("%d",&n);
    for (int i=2;i<=n;i++) scanf("%d",&a[i]),deg[a[i]]++;
    int h=0;
    for (int i=1;i<=n;i++) if (!deg[i]) que.push(mp(0,i));
    while (!que.empty())
    {
        int x=que.top().second;que.pop();
        f[a[x]]=max(f[a[x]],f[x])+1;
        deg[a[x]]--;
        if (!deg[a[x]]) que.push(mp(-f[a[x]],a[x]));
    }
    printf("%d",f[1]);
    return 0;
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:17:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
                   ^
./Main.cpp:18:57: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     for (int i=2;i<=n;i++) scanf("%d",&a[i]),deg[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 24 ms 1912 KB
02.txt AC 24 ms 1912 KB
03.txt AC 24 ms 1912 KB
04.txt AC 24 ms 1912 KB
05.txt AC 24 ms 1912 KB
06.txt AC 24 ms 1912 KB
07.txt AC 24 ms 1912 KB
08.txt AC 24 ms 1912 KB
09.txt AC 24 ms 1912 KB
10.txt AC 24 ms 1912 KB
11.txt AC 12 ms 1408 KB
12.txt AC 16 ms 1788 KB
13.txt AC 17 ms 1788 KB
14.txt AC 19 ms 1788 KB
15.txt AC 20 ms 1784 KB
16.txt AC 21 ms 1784 KB
17.txt AC 21 ms 1784 KB
18.txt AC 22 ms 1784 KB
19.txt AC 22 ms 1784 KB
20.txt AC 22 ms 1784 KB
21.txt AC 21 ms 1784 KB
22.txt AC 21 ms 1784 KB
23.txt AC 21 ms 1784 KB
24.txt AC 21 ms 1784 KB
25.txt AC 21 ms 1784 KB
26.txt AC 21 ms 1784 KB
27.txt AC 21 ms 1784 KB
28.txt AC 21 ms 1784 KB
29.txt AC 22 ms 1784 KB
30.txt AC 22 ms 1784 KB
31.txt AC 21 ms 1532 KB
32.txt AC 22 ms 1912 KB
33.txt AC 22 ms 1912 KB
34.txt AC 23 ms 1912 KB
35.txt AC 22 ms 1784 KB
36.txt AC 22 ms 1784 KB
37.txt AC 22 ms 1784 KB
38.txt AC 22 ms 1784 KB
39.txt AC 22 ms 1784 KB
40.txt AC 21 ms 1784 KB
41.txt AC 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 AC 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