Submission #847671

#	Time	Username	Problem	Language	Result	Execution time	Memory
847671		vjudge1	Beech Tree (IOI23_beechtree)	C++17	9 / 100	66 ms	16724 KiB

beechtree

#include "beechtree.h"

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

std::vector<int> beechtree(int N, int M, std::vector<int> P, std::vector<int> C) {
        vector<vector<int>> c(N);
        for (int i = 1; i < N; i++) {
                c[P[i]].emplace_back(C[i] - 1);
        }
        vector<int> f(N, 1);
        for (int i = 0; i < N; i++) {
                sort(c[i].begin(), c[i].end());
                for (int j = 1; j < c[i].size(); j++) {
                        if (c[i][j] == c[i][j - 1]) f[i] = f[0] = 0;
                }
        }
        vector<int> ord(N);
        iota(ord.begin(), ord.end(), 0);
        sort(ord.begin(), ord.end(), [&](int i, int j) {
                return c[i].size() > c[j].size();
        });
        if (ord[0] != 0) return f[0] = 0, f;
        for (int i = 1; i < N; i++) {
                for (int j : c[ord[i]]) {
                        if (!binary_search(c[ord[i - 1]].begin(), c[ord[i - 1]].end(), j)) return f[0] = 0, f;
                }
        }
        return f;
}

Compilation message (stderr)

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

• Subtask 0: 0 / 0
• Subtask 1: 0 / 9
• Subtask 2: 0 / 5
• Subtask 3: 9 / 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