oj.uz

답안 #1031553

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1031553 2024-07-23T00:46:40 Z aaaaaarroz 참나무 (IOI23_beechtree) C++17
0 / 100
 0 ms 436 KB 
#include <bits/stdc++.h>
using namespace std;
vector<int> padre;
vector<int>suma;
vector<int>cc;
bool menor_padre(int i, int j){
	if(suma[cc[i]]!=suma[cc[j]]){
		return suma[cc[i]]<suma[cc[j]];
	}
	return i>j;
}
vector<int> beechtree(int n, int m, vector<int>P, vector<int>C){
	vector<vector<int>> graph(n,vector<int>());
	padre = P;
	cc=C;
	for(int i = 1; i < n; i++){
		graph[P[i]].push_back(i);
	}
	vector<int> ans(n, 0);
	for(int i = 0; i < n; i++){
		suma.assign(m,0);
		vector<int> sub;
		stack<int> pila;
		pila.push(i);
		while(!pila.empty()){
			int nodo = pila.top(); 
			pila.pop();
			sub.push_back(nodo);
			suma[C[nodo]]++;
			for(int vecino : graph[nodo]){
				pila.push(vecino);
			} 
		}
		sort(sub.begin(),sub.end(),menor_padre);  
		if(sub.size() == 1){
			ans[i] = 1;  
			continue;
		}
		bool bien = true;
		map<int, int> repeticiones;
		for(int j = 1; j < sub.size(); j++){
			int color = C[sub[j]];
			if(repeticiones.find(color) == repeticiones.end()){
				repeticiones[color] = 0;
			}
			int expected_parent = sub[repeticiones[color]]; 
			if(P[sub[j]] != expected_parent){
				bien = false;
				break;
			}
			repeticiones[color]++;
		}
		if(bien){
			ans[i] = 1;
		}
	}
	return ans;
}

Compilation message

beechtree.cpp: In function 'std::vector<int> beechtree(int, int, std::vector<int>, std::vector<int>)':
beechtree.cpp:41:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |   for(int j = 1; j < sub.size(); j++){
      |                  ~~^~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 436 KB 2nd lines differ - on the 2nd token, expected: '1', found: '0'
3 Halted 0 ms 0 KB -

Subtask #1
0.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 2nd lines differ - on the 1st token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 2nd lines differ - on the 1st token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB 2nd lines differ - on the 2nd token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 2nd lines differ - on the 1st token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 436 KB 2nd lines differ - on the 2nd token, expected: '1', found: '0'
3 Halted 0 ms 0 KB -

Subtask #6
0.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 2nd lines differ - on the 1st token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 436 KB 2nd lines differ - on the 2nd token, expected: '1', found: '0'
3 Halted 0 ms 0 KB -

Subtask #8
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 2nd lines differ - on the 1st token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #9
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 436 KB 2nd lines differ - on the 2nd token, expected: '1', found: '0'
3 Halted 0 ms 0 KB -