제출 #238690

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
238690		Vimmer	Birokracija (COCI18_birokracija)	C++14	100 / 100	142 ms	34808 KiB

birokracija

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 200001
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 2> a2;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;



set <int> g[N];

ll dp[N], a[N], kol[N];

void dfs(int v)
{
    kol[v] = 1;

    for (auto it : g[v])
    {
        dfs(it);

        kol[v] += kol[it];

        dp[v] += dp[it];
    }

    dp[v] += kol[v];
}
int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n;

    cin >> n;

    for (int i = 2; i <= n; i++)
    {
        int x;

        cin >> x;

        g[x].insert(i);
    }

    dfs(1);

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