Submission #1010250

#	Time	Username	Problem	Language	Result	Execution time	Memory
1010250		aaaaaarroz	Beech Tree (IOI23_beechtree)	C++17	0 / 100	2055 ms	29044 KiB

beechtree

#include <bits/stdc++.h>
using namespace std;
vector<int> padre;
map<int,int>asociar;
bool menor_padre(int i, int j){
    return asociar[padre[i]] < asociar[padre[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++){
        asociar.clear();
        vector<int> sub;
        queue<int> cola;
        cola.push(i);
        while(!cola.empty()){
            int nodo = cola.front(); 
            cola.pop();
            sub.push_back(nodo); 
            asociar[nodo]=sub.size()-1;
            for(int vecino : graph[nodo]){
                cola.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;
}

Compilation message (stderr)

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