Submission #1073889


Source Code Expand

#include <bits/stdc++.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define RI(X) scanf("%d", &(X))
#define RII(X, Y) scanf("%d%d", &(X), &(Y))
#define RIII(X, Y, Z) scanf("%d%d%d", &(X), &(Y), &(Z))
#define DRI(X) int (X); scanf("%d", &X)
#define DRII(X, Y) int X, Y; scanf("%d%d", &X, &Y)
#define DRIII(X, Y, Z) int X, Y, Z; scanf("%d%d%d", &X, &Y, &Z)
#define RS(X) scanf("%s", (X))
#define CASET int ___T, case_n = 1; scanf("%d ", &___T); while (___T-- > 0)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define PII pair<int,int>
#define VI vector<int>
#define VPII vector<pair<int,int> >
#define PLL pair<long long,long long>
#define VPLL vector<pair<long long,long long> >
#define F first
#define S second
typedef long long LL;
using namespace std;
const int MOD = 1e9+7;
const int SIZE = 1e6+10;
int a[SIZE],an[SIZE];
VI e[SIZE];
template <class T>
void maa(T& x,T y){
    if(x<y)x=y;
}
template <class T>
void mii(T& x,T y){
    if(x>y)x=y;
}
void f(int x){
    VI d;
    REP(i,SZ(e[x])){
        f(e[x][i]);
        d.PB(an[e[x][i]]+1);
    }
    sort(ALL(d),greater<int>());
    REP(i,SZ(d)){
        maa(an[x],d[i]+i);
    }
}
int main(){
    DRI(N);
    REPP(i,2,N+1){
        RI(a[i]);
        e[a[i]].PB(i);
    }
    f(1);
    printf("%d\n",an[1]);
    return 0;
}

Submission Info

Submission Time
Task B - Tournament
User dreamoon
Language C++14 (GCC 5.4.1)
Score 800
Code Size 1577 Byte
Status AC
Exec Time 62 ms
Memory 36992 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:52:11: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     DRI(N);
           ^
./Main.cpp:54:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         RI(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 54 ms 26112 KB
02.txt AC 55 ms 26112 KB
03.txt AC 55 ms 26112 KB
04.txt AC 55 ms 26112 KB
05.txt AC 55 ms 26112 KB
06.txt AC 56 ms 26112 KB
07.txt AC 62 ms 26112 KB
08.txt AC 58 ms 26112 KB
09.txt AC 56 ms 26112 KB
10.txt AC 55 ms 26112 KB
11.txt AC 62 ms 36992 KB
12.txt AC 59 ms 33536 KB
13.txt AC 58 ms 31744 KB
14.txt AC 55 ms 30080 KB
15.txt AC 56 ms 28800 KB
16.txt AC 53 ms 27776 KB
17.txt AC 53 ms 27136 KB
18.txt AC 53 ms 26624 KB
19.txt AC 53 ms 26496 KB
20.txt AC 54 ms 26496 KB
21.txt AC 39 ms 25208 KB
22.txt AC 38 ms 24928 KB
23.txt AC 39 ms 24820 KB
24.txt AC 39 ms 24832 KB
25.txt AC 37 ms 24704 KB
26.txt AC 37 ms 24576 KB
27.txt AC 38 ms 24576 KB
28.txt AC 39 ms 24576 KB
29.txt AC 40 ms 24704 KB
30.txt AC 40 ms 24704 KB
31.txt AC 49 ms 25856 KB
32.txt AC 48 ms 25216 KB
33.txt AC 46 ms 24960 KB
34.txt AC 45 ms 24960 KB
35.txt AC 44 ms 24960 KB
36.txt AC 41 ms 24576 KB
37.txt AC 41 ms 24576 KB
38.txt AC 39 ms 24576 KB
39.txt AC 38 ms 24576 KB
40.txt AC 38 ms 24448 KB
41.txt AC 28 ms 23680 KB
42.txt AC 27 ms 23680 KB
43.txt AC 27 ms 23680 KB
44.txt AC 27 ms 23680 KB
45.txt AC 27 ms 23680 KB
46.txt AC 27 ms 23680 KB
47.txt AC 27 ms 23680 KB
48.txt AC 27 ms 23680 KB
49.txt AC 28 ms 23680 KB
50.txt AC 27 ms 23680 KB
s1.txt AC 27 ms 23680 KB
s2.txt AC 27 ms 23680 KB
s3.txt AC 27 ms 23680 KB