Submission #83142

#	Time	Username	Problem	Language	Result	Execution time	Memory
83142		Leonardo_Paes	Birokracija (COCI18_birokracija)	C++11	100 / 100	209 ms	29060 KiB

birokracija

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const int MAXN=2e5+10;

int n, m;
int in[MAXN], qc[MAXN];
ll resposta[MAXN];
vector <int> graph[MAXN];

int dfs(int u, int f){

	
	for(int v: graph[u]){
		if(v!=f){

			int qv=dfs(v, u);
			qc[u]+=qv;
			resposta[u]+=resposta[v]+qv;
		}
	}

	resposta[u]++;
	qc[u]++;
	return qc[u];
}

int main(){
	
	cin >> n;

	for(int i=2;i<=n;++i){	
		cin >> in[i];
		graph[i].push_back(in[i]);
		graph[in[i]].push_back(i);
	}

	dfs(1, 1);

	for(int i=1;i<=n;++i){
		cout << resposta[i] << " \n"[i==n];
	}

	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