Submission #1031570

#	Time	Username	Problem	Language	Result	Execution time	Memory
1031570		aaaaaarroz	참나무 (IOI23_beechtree)	C++17	0 / 100	1 ms	348 KiB

beechtree

#include <bits/stdc++.h>
using namespace std;
vector<int> beechtree(int n, int m, vector<int> P, vector<int> C) {
    vector<vector<int>> graph(n);
    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> subtree;
        stack<int> s;
        s.push(i);
        while (!s.empty()) {
            int node = s.top(); s.pop();
            subtree.push_back(node);
            for (int neighbor : graph[node]) {
                s.push(neighbor);
            }
        }
        sort(subtree.begin() + 1, subtree.end(), [&](int a, int b) {
            if (C[a] != C[b]) {
                return C[a] < C[b];
            }
            return a > b;
        });
        bool is_bonito = true;
        for (int j = 1; j < subtree.size(); ++j) {
            if (P[subtree[j]] != subtree[j - 1]) {
                is_bonito = false;
                break;
            }
        }
        ans[i] = is_bonito ? 1 : 0;
    }
    return ans;
}

Compilation message (stderr)

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