Submission #1379950

---

Source Code Expand

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

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i,n) for(int i=0;i<(int)n;++i)

typedef vector<pii> Array;
typedef vector<Array> Graph;
Graph G(100005);

int get_connect(int ver, int edge){
    if(G[ver][edge].second != -1) return G[ver][edge].second;
    int res = 1;
    int next = G[ver][edge].first;
    REP(i, G[next].size()){
        if(G[next][i].first != ver) res += get_connect(next, i);
    }
    G[ver][edge].second = res;
    return res;
}

int main(){
    int N;
    cin >> N;
    REP(i, N-1){
        int p;
        cin >> p;
        pii q,r;
        q.first = p;
        q.second = -1;
        r.first = i+1;
        r.second = -1;
        G[i+1].push_back(q);
        G[p].push_back(r);
    }
    REP(i, N){
        int res = -1;
        REP(j, G[i].size()){
            res = max(res, get_connect(i, j));
        }
        cout << res << endl;
    }
    return 0;
}

Submission Info

Judge Result