oj.uz

Submission #294564

# Submission time Handle Problem Language Result Execution time Memory
294564 2020-09-09T05:13:02 Z 7_7_7 Utrka (COCI14_utrka) C++17
0 / 80
 3 ms 4992 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 7;

int n;
int sub[N];
long long cnt[N];
vector<int> g[N];
void dfs(int v, int p){
    sub[v] = 1, cnt[v] = 1;
    for(auto to: g[v]){
        if(to == p) continue;

        dfs(to, v);
        cnt[v] += cnt[to] + sub[to];
        sub[v] += sub[to];
    }
}
int main()
{
    ios_base::sync_with_stdio(false);

    cin >> n;
    for(int i = 2; i <= n; i ++){
        int x;
        cin >> x;
        g[x].push_back(i);
        g[i].push_back(x);
    }
    dfs(1, 1);
    for(int i = 1; i <= n; i ++){
        cout << cnt[i] << " ";
    }
}

Subtask #1
0 / 80.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 4992 KB Output isn't correct
2 Halted 0 ms 0 KB -