Submission #1018538

#	Time	Username	Problem	Language	Result	Execution time	Memory
1018538		vjudge1	Birokracija (COCI18_birokracija)	C++17	100 / 100	75 ms	28756 KiB

birokracija

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

const int N = 2e5 + 10;
int n, p[N], sz[N];
long long dp[N];
vector<int> g[N];

void dfs(int v){
    sz[v] = 1;
    for (int u : g[v]){
        dfs(u);
        sz[v] += sz[u];
        dp[v] += dp[u];
    }
    dp[v] += sz[v];
}

int main(){
    cin >> n;
    for (int i = 2; i <= n; i ++){
        cin >> p[i];
        g[p[i]].push_back(i);
    }

    dfs(1);

    for (int i = 1; i <= n; i ++)
        cout << dp[i] << " ";
    cout << endl;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10