제출 #1031533

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1031533		aaaaaarroz	참나무 (IOI23_beechtree)	C++17	0 / 100	2044 ms	20436 KiB

beechtree

    #include <bits/stdc++.h>
    using namespace std;
    vector<int> padre;
    bool menor_padre(int i, int 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;
    	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++){
    		vector<int> sub;
    		priority_queue<int,vector<int>,greater<int>> pila;
    		pila.push(i);
    		while(!pila.empty()){
    			int nodo = pila.top(); 
    			pila.pop();
    			sub.push_back(nodo);
    			for(int vecino : graph[nodo]){
    				pila.push(vecino);
    			} 
    		}
    		if(sub.size() == 1){
    			ans[i] = 1;  
    			continue;
    		}
    		sort(sub.begin()+1, sub.end(),menor_padre);  
    		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;
    }

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

beechtree.cpp: In function 'std::vector<int> beechtree(int, int, std::vector<int>, std::vector<int>)':
beechtree.cpp:33:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |       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