제출 #364965

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
364965		vishesh312	Birokracija (COCI18_birokracija)	C++17	100 / 100	98 ms	27756 KiB

birokracija

#include "bits/stdc++.h"
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using ordered_set = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
*/

#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()

using ll = long long;
const int mod = 1e9+7;
vector<vector<int>> adj;
vector<ll> mon, belo;

void dfs(int u, int par) {
    if (!sz(adj[u])) {
        mon[u] = 1;
        return;
    }
    for (int v : adj[u]) {
        dfs(v, u);
    }
    for (int v : adj[u]) {
        mon[u] += mon[v];
        belo[u] += belo[v] + 1;
    }
    mon[u] += belo[u] + 1;
}

void solve(int tc) {
    int n;
    cin >> n;
    adj.resize(n);
    mon.resize(n);
    belo.resize(n);
    vector<int> par(n);
    for (int i = 1; i < n; ++i) {
        cin >> par[i];
        --par[i];
        adj[par[i]].push_back(i);
    }
    dfs(0, -1);
    for (auto &x : mon) cout << x << " ";
    cout << '\n';
}

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    int tc = 1;
    //cin >> tc;
    for (int i = 1; i <= tc; ++i) solve(i);
    return 0;
}

• 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