oj.uz

Submission #83142

# Submission time Handle Problem Language Result Execution time Memory
83142 2018-11-05T15:16:44 Z Leonardo_Paes Birokracija (COCI18_birokracija) C++11
100 / 100
 209 ms 29060 KB 
#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.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5236 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5236 KB Output is correct
2 Correct 6 ms 5236 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5236 KB Output is correct
2 Correct 6 ms 5280 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5280 KB Output is correct
2 Correct 6 ms 5280 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 6176 KB Output is correct
2 Correct 26 ms 6564 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 8764 KB Output is correct
2 Correct 53 ms 8820 KB Output is correct
3 Correct 65 ms 10064 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 196 ms 15260 KB Output is correct
2 Correct 152 ms 17052 KB Output is correct
3 Correct 149 ms 29060 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 209 ms 29060 KB Output is correct
2 Correct 152 ms 29060 KB Output is correct
3 Correct 153 ms 29060 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 185 ms 29060 KB Output is correct
2 Correct 150 ms 29060 KB Output is correct
3 Correct 161 ms 29060 KB Output is correct