제출 #237512

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
237512		NONAME	Birokracija (COCI18_birokracija)	C++17	100 / 100	151 ms	38520 KiB

birokracija

#include <bits/stdc++.h>
#define sz(x) int(x.size())
#define pb push_back
#define mp make_pair
#define ft first
#define sd second
using namespace std;

typedef long long ll;
const int N = 2e5 + 10;

ll f[N];
int n, d[N], pr[N];
vector <int> g[N];
set <int> se[N];

void dfs(int v, int pred = -1) {
    d[v] = 1;

    for (int i = 0; i < sz(g[v]); ++i) {
        int to = g[v][i];

        if (to == pred)
            continue;

        dfs(to, v);

        f[v] += f[to];
        d[v] += d[to];
    }

    f[v] += d[v];
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> n;

    for (int i = 0; i < n; ++i)
        pr[i] = i;

    for (int i = 1; i < n; ++i) {
        int x;
        cin >> x;
        x--;

        g[i].pb(x);
        g[x].pb(i);
    }

    dfs(0);

    for (int i = 0; i < n; ++i)
        cout << f[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