Submission #1348958

#	Time	Username	Problem	Language	Result	Execution time	Memory
1348958		jump	Birokracija (COCI18_birokracija)	C++20	70 / 100	48 ms	14672 KiB

birokracija

#include <bits/stdc++.h>

std::vector<int> child[500010];
int ans[500010];
std::pair<int,int> dfs(int curr){
	int size = 1;
	int money = 1;
	for(auto to:child[curr]){
		auto v = dfs(to);
		size+=v.first;
		money+=v.second;
	}
	money+=size-1;
	ans[curr]=money;
	return {size,money};
}
signed main(){
	int n;
	std::cin >> n;
	for(int i=2;i<=n;i++){
		int boss;
		std::cin >> boss;
		child[boss].push_back(i);
	}
	dfs(1);
	for(int i=1;i<=n;i++)std::cout << ans[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