제출 #44246

#제출 시각아이디문제언어결과실행 시간메모리
44246heonBirokracija (COCI18_birokracija)C++11
70 / 100
170 ms27492 KiB
#include<bits/stdc++.h>

using namespace std;

int n;
int sol[200005];
vector <int> graph[200005];
int temp[200005];

int dfs(int a){
	temp[a] = 1;
	for(auto x : graph[a]){
		dfs(x);
		temp[a] += temp[x];
		sol[a] += sol[x];
	}
	sol[a] += temp[a];
}

int main(){
	cin >> n;
	for(int i = 2; i < n+1; i++){
		int a;
		cin >> a;
		graph[a].push_back(i);
	}
	dfs(1);
	for(int i = 1; i <= n; i++){
		cout << sol[i] << " ";
	}
}

컴파일 시 표준 에러 (stderr) 메시지

birokracija.cpp: In function 'int dfs(int)':
birokracija.cpp:18:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...