Submission #44912590

---

Source Code Expand

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

#define rep(i,n) for(int i = 0; i <(n);++i)

using ll = long long;
int main(){
    ll n;
    cin >> n;
    vector<int> p(n);
    vector<int> c(n);
    vector<int> res(n, 1);
    for (int i = 1; i < n; ++i) {
        cin >> p[i];
        p[i]--;
        c[p[i]]++;
    }
    vector<int> q;
    
    rep(i,n) {
        if (c[i] == 0) q.push_back(i);
    }
    while(!q.empty()) {
        int i = q.back(); q.pop_back();
        if (i == 0) break;
        res[p[i]] += res[i];
        if (--c[p[i]] == 0){
            q.push_back(p[i]);
        }
    }
    
    for (int i = 0; i < n; ++i) {
        cout << res[i] << endl;
    }
}

Submission Info

Judge Result