Submission #1031569

#	Time	Username	Problem	Language	Result	Execution time	Memory
1031569		aaaaaarroz	Beech Tree (IOI23_beechtree)	C++17	0 / 100	2045 ms	440 KiB

beechtree

#include <bits/stdc++.h>
using namespace std;
vector<int> padre;
vector<set<int>>suma;
vector<int>cc;
bool menor_padre(int i, int j){
	if(suma[cc[i]].size()!=suma[cc[j]].size()){
		return suma[cc[i]].size()<suma[cc[j]].size();
	}
	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++){
		set<int>xd;
		suma.assign(m,xd);
		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]].insert(nodo);
			for(int vecino : graph[nodo]){
				pila.push(vecino);
			} 
		}
		sort(sub.begin()+1,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 (stderr)

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

• Subtask 0: 0 / 0
• Subtask 1: 0 / 9
• Subtask 2: 0 / 5
• Subtask 3: 0 / 9
• Subtask 4: 0 / 8
• Subtask 5: 0 / 14
• Subtask 6: 0 / 14
• Subtask 7: 0 / 12
• Subtask 8: 0 / 17
• Subtask 9: 0 / 12