Submission #1336658

#TimeUsernameProblemLanguageResultExecution timeMemory
1336658nathlol2Birokracija (COCI18_birokracija)C++20
100 / 100
39 ms28884 KiB
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 2e5 + 5;
int n, dp[N], sz[N];
vector<int> adj[N];

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

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    cin >> n;
    for(int i = 2;i<=n;i++){
        int u; cin >> u;
        adj[u].push_back(i);
    }
    dfs(1);
    for(int i = 1;i<=n;i++) cout << dp[i] << ' ';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...