제출 #83138

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
83138		Leonardo_Paes	Birokracija (COCI18_birokracija)	C++11	70 / 100	1071 ms	11408 KiB

birokracija

#include <bits/stdc++.h>

using namespace std;

#define MAXN 200100

vector<int> grafo[MAXN];

int resp[MAXN], pai[MAXN], mark[MAXN];

void dfs (int u, int num, int sum){
	mark[u]=1;
	resp[u]+=sum;
	if(pai[u]==0)return;

	if(mark[pai[u]]==0){
		num++;
	}

	dfs(pai[u], num, (sum+num));

}

int main(){

	int n;

	cin >> n;

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

		int p;

		cin >> p;

		grafo[p].push_back(i);
		
		pai[i]=p;
	}

	pai[1]=0;

	for(int i=2; i<=n; i++){
		if(grafo[i].size() == 0){
			dfs(i, 1, 1);
		}
	}

	for(int i=1; i<=n; i++){
		cout << resp[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: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10