제출 #85738

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
85738		heon	Birokracija (COCI18_birokracija)	C++11	100 / 100	346 ms	39928 KiB

birokracija

#include<bits/stdc++.h>

using namespace std;

vector <int> g[200005];
map <int,long long> mp;

int dfs(int x, int parent){
	int res = 1;
	for(auto y : g[x]){
		res += dfs(y, x);
	}
	mp[x] += res;
	if(x != 1) mp[parent] += mp[x]; 
	return res;
}

int main(){
	
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	int n;
	cin >> n;
	for(int i = 2; i <= n; i++){
		int x;
		cin >> x;
		g[x].push_back(i);
		//g[i].push_back(x);
	}
	dfs(1, -1);
	for(int i = 1; i <= n; i++) cout << mp[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