Submission #1018562

#	Time	Username	Problem	Language	Result	Execution time	Memory
1018562		vjudge1	Birokracija (COCI18_birokracija)	C++17	100 / 100	63 ms	28828 KiB

birokracija

#include <bits/stdc++.h>
using namespace std;

#define int long long
int const N=2e5+5;
int const mod=1e9+7;

vector<int> child[N];
int pay[N],sz[N];
void dfs(int node){
	sz[node]=1;
	for(int i:child[node]){
		dfs(i);
		pay[node]+=pay[i];
		sz[node]+=sz[i];
	}
	pay[node]+=sz[node];
}
signed main(){
	int n;
	cin>>n;
	for(int i=2;i<=n;i++){
		int p;
		cin>>p;
		child[p].push_back(i);
	}
	dfs(1);
	for(int i=1;i<=n;i++)
		cout<<pay[i]<<' ';
	cout<<endl;
	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