Submission #1236721

#	Time	Username	Problem	Language	Result	Execution time	Memory
1236721		PlayVoltz	Birokracija (COCI18_birokracija)	C++20	100 / 100	38 ms	31816 KiB

birokracija

#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
#include <random>
#include <chrono>
#include <fstream>
using namespace std;

#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

vector<int> sz, dp;
vector<vector<int> > graph;

void dfs(int node){
	for (auto num:graph[node])dfs(num), sz[node]+=sz[num], dp[node]+=dp[num]+sz[num];
}

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, a;
	cin>>n;
	graph.resize(n+1);
	sz.resize(n+1, 1);
	dp.resize(n+1, 1);
	for (int i=2; i<=n; ++i)cin>>a, graph[a].pb(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