제출 #1331152

#제출 시각아이디문제언어결과실행 시간메모리
1331152Zone_zoneeBirokracija (COCI18_birokracija)C++20
100 / 100
40 ms28076 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 2e5+10;

int sub_tree[N];
ll dp[N];
vector<int> adj[N];
void dfs(int u){
    dp[u] = 1;
    sub_tree[u] = 1;
    for(auto v : adj[u]){
        dfs(v);
        dp[u] += dp[v] + sub_tree[v];
        sub_tree[u] += sub_tree[v];
    }
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    for(int i = 2; i <= n; ++i){
        int a;
        cin >> a;
        adj[a].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...