Submission #294563

#	Time	Username	Problem	Language	Result	Execution time	Memory
294563		7_7_7	Birokracija (COCI18_birokracija)	C++17	70 / 100	142 ms	20088 KiB

birokracija

#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 7;

int n;
int cnt[N];
int sub[N];
vector<int> g[N];
void dfs(int v, int p){
    sub[v] = 1, cnt[v] = 1;
    for(auto to: g[v]){
        if(to == p) continue;

        dfs(to, v);
        cnt[v] += cnt[to] + sub[to];
        sub[v] += sub[to];
    }
}
int main()
{
    ios_base::sync_with_stdio(false);

    cin >> n;
    for(int i = 2; i <= n; i ++){
        int x;
        cin >> x;
        g[x].push_back(i);
        g[i].push_back(x);
    }
    dfs(1, 1);
    for(int i = 1; i <= n; i ++){
        cout << cnt[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: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10