Submission #1098891


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define int long long   // <-----!!!!!!!!!!!!!!!!!!!

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(a)-1;i>=b;i--)
#define chmin(a,b) (a)=min((a),(b));
#define chmax(a,b) (a)=max((a),(b));
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define printV(v) cerr<<(#v)<<":";for(auto(x):(v)){cerr<<" "<<(x);}cerr<<endl;
#define printVS(vs) cerr<<(#vs)<<":"<<endl;for(auto(s):(vs)){cerr<<(s)<< endl;}
#define printVV(vv) cerr<<(#vv)<<":"<<endl;for(auto(v):(vv)){for(auto(x):(v)){cerr<<" "<<(x);}cerr<<endl;}
#define printP(p) cerr<<(#p)<<(p).first<<" "<<(p).second<<endl;
#define printVP(vp) cerr<<(#vp)<<":"<<endl;for(auto(p):(vp)){cerr<<(p).first<<" "<<(p).second<<endl;}

inline void output(){ cerr << endl; }
template<typename First, typename... Rest>
inline void output(const First& first, const Rest&... rest) {
    cerr << first << " "; output(rest...);
}

using ll = long long;
using Pii = pair<int, int>;
using TUPLE = tuple<int, int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
const int inf = 1ll << 60;
const int mod = 1e9 + 7;
using Graph = vector<vector<int>>;

int dfs(int now, int pre, const Graph& G) {
    vi a;
    for (auto nxt : G[now]) {
        a.emplace_back(dfs(nxt, now, G));
    }
    sort(all(a));
    int ret = 0;
    for (auto x : a) {
        ret = max(ret, x) + 1;
    }
    return ret;
}

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);

    int n;
    cin >> n;
    Graph G(n);
    rep2(c, 1, n) {
        int p;
        cin >> p;
        G[p - 1].emplace_back(c);
    }
    cout << dfs(0, -1, G) << endl;
}

Submission Info

Submission Time
Task B - Tournament
User yurahuna
Language C++14 (GCC 5.4.1)
Score 800
Code Size 1855 Byte
Status AC
Exec Time 37 ms
Memory 15104 KB

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 30 ms 4480 KB
02.txt AC 30 ms 4480 KB
03.txt AC 30 ms 4480 KB
04.txt AC 30 ms 4480 KB
05.txt AC 30 ms 4480 KB
06.txt AC 30 ms 4480 KB
07.txt AC 30 ms 4480 KB
08.txt AC 30 ms 4480 KB
09.txt AC 30 ms 4480 KB
10.txt AC 30 ms 4480 KB
11.txt AC 37 ms 15104 KB
12.txt AC 35 ms 11776 KB
13.txt AC 33 ms 9984 KB
14.txt AC 31 ms 8320 KB
15.txt AC 30 ms 7040 KB
16.txt AC 29 ms 6016 KB
17.txt AC 28 ms 5376 KB
18.txt AC 28 ms 4992 KB
19.txt AC 28 ms 4736 KB
20.txt AC 29 ms 4736 KB
21.txt AC 17 ms 4980 KB
22.txt AC 16 ms 4332 KB
23.txt AC 17 ms 4136 KB
24.txt AC 16 ms 3852 KB
25.txt AC 14 ms 3840 KB
26.txt AC 15 ms 3712 KB
27.txt AC 15 ms 3584 KB
28.txt AC 15 ms 3712 KB
29.txt AC 16 ms 3840 KB
30.txt AC 17 ms 3712 KB
31.txt AC 24 ms 4224 KB
32.txt AC 25 ms 4224 KB
33.txt AC 22 ms 3712 KB
34.txt AC 22 ms 3968 KB
35.txt AC 22 ms 4224 KB
36.txt AC 18 ms 3456 KB
37.txt AC 17 ms 3456 KB
38.txt AC 16 ms 3584 KB
39.txt AC 15 ms 3584 KB
40.txt AC 14 ms 3456 KB
41.txt AC 3 ms 256 KB
42.txt AC 3 ms 256 KB
43.txt AC 3 ms 256 KB
44.txt AC 3 ms 256 KB
45.txt AC 3 ms 256 KB
46.txt AC 3 ms 256 KB
47.txt AC 3 ms 256 KB
48.txt AC 3 ms 256 KB
49.txt AC 3 ms 256 KB
50.txt AC 3 ms 256 KB
s1.txt AC 3 ms 256 KB
s2.txt AC 3 ms 256 KB
s3.txt AC 3 ms 256 KB