제출 #83139

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

birokracija

#include <bits/stdc++.h>

using namespace std;

#define MAXN 200100

vector<int> grafo[MAXN];

pair<int,int> resp[MAXN];

pair<int,int> dfs (int u){
	
	for(int i=0; i<grafo[u].size(); i++){
		pair<int,int> x = dfs(grafo[u][i]);
		resp[u].first+=x.first;
		resp[u].second+=x.second+x.first;
	}
	return resp[u];
}

int main(){

	int n;

	cin >> n;

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

		int p;

		cin >> p;

		grafo[p].push_back(i);
	}

	for(int i=1; i<=n; i++){
		resp[i].first=resp[i].second=1;
	}

	pair<int,int> k = dfs(1);

	for(int i=1; i<=n; i++){
		cout << resp[i].second << " ";
	}

	cout << endl;

	return 0;

}

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

birokracija.cpp: In function 'std::pair<int, int> dfs(int)':
birokracija.cpp:13:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<grafo[u].size(); i++){
               ~^~~~~~~~~~~~~~~~
birokracija.cpp: In function 'int main()':
birokracija.cpp:40:16: warning: variable 'k' set but not used [-Wunused-but-set-variable]
  pair<int,int> k = dfs(1);
                ^

• 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