제출 #251988

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
251988		Vladikus004	Birokracija (COCI18_birokracija)	C++14	100 / 100	92 ms	26492 KiB

birokracija

#include <bits/stdc++.h>
#define inf 2e9
#define int long long
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
const int N = 200000 + 3;
int n, sum[N], k[N];
vector <vector <int> > v;

void dfs(int x){
    for (auto u: v[x]){
        dfs(u);
        sum[x] += sum[u] + k[u];
        k[x] += k[u];
    }
    sum[x]++;
    k[x]++;
}

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    #ifdef LOCAL
        freopen("input.txt", "r", stdin);
    #endif // LOCAL
    cin >> n;
    v.resize(n);
    for (int i = 1; i < n; i++){
        int x;
        cin >> x;
        --x;
        v[x].push_back(i);
    }
    dfs(0);
    for (int i = 0; i < n; i++)
        cout << sum[i] << " ";
}

• 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