제출 #1008813

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

beechtree

#include <bits/stdc++.h>
using namespace std;

vector<int> padre;

bool menor_padre(int i, int j) {
    return padre[i] < padre[j];
}

vector<int> beechtree(int n, int m, vector<int> P, vector<int> C) {
    vector<vector<int>> graph(n);
    padre = P;

    // Construir el árbol
    for (int i = 1; i < n; i++) {
        graph[P[i]].push_back(i);
    }

    vector<int> ans(n, 0);
    
    // Evaluar cada nodo r como raíz del subárbol
    for (int r = 0; r < n; r++) {
        vector<int> sub;
        queue<int> cola;
        cola.push(r);
        
        // Recorrer el subárbol T(r)
        while (!cola.empty()) {
            int nodo = cola.front();
            cola.pop();
            sub.push_back(nodo);
            for (int vecino : graph[nodo]) {
                cola.push(vecino);
            }
        }

        // Verificar si el subárbol es bonito
        // Usamos un vector para llevar la cuenta de la última aparición del color
        vector<int> last_occurrence(m + 1, -1);
        bool bien = true;
        
        for (int i = 0; i < sub.size(); i++) {
            int nodo = sub[i];
            int color = C[nodo];
            if (last_occurrence[color] != -1) {
                int expected_parent = sub[last_occurrence[color]];
                if (P[nodo] != expected_parent) {
                    bien = false;
                    break;
                }
            }
            last_occurrence[color] = i;
        }
        
        if (bien) {
            ans[r] = 1;
        }
    }

    return ans;
}

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

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

• 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