Submission #1160823

#	Time	Username	Problem	Language	Result	Execution time	Memory
1160823		johar444555	Birokracija (COCI18_birokracija)	C++20	100 / 100	88 ms	30544 KiB

birokracija

#include <chrono>
#include <iostream>
#include <map>
#include <set>
#include <unordered_map>
#include <vector>

using namespace std;

typedef long long ll;

vector<vector<int>> gr;
vector<ll> res;

ll dfs(int v) {
    ll size = 1;
    ll curres = 0;
    for (auto u: gr[v]) {
        size += dfs(u);
        curres += res[u];
    }
    res[v] = curres + size;
    return size;
}
int main() {
    int n;
    cin >> n;
    gr.resize(n);
    res.resize(n);

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

        gr[cur - 1].push_back(i);
    }
    dfs(0);

    for (const auto& item: res){
        cout << item << ' ';
    }
    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