Submission #1221335

#	Time	Username	Problem	Language	Result	Execution time	Memory
1221335		im2xtreme	Beech Tree (IOI23_beechtree)	C++20	0 / 100	2093 ms	26500 KiB

beechtree

#include <iostream>
#include <vector>
#include <unordered_map>
#include "beechtree.h"
using namespace std;

const int MAXN = 200005;

vector<int> tree[MAXN];

void collect_subtree(int u, vector<int>& nodes) {
    nodes.push_back(u);
    for (int v : tree[u]) {
        collect_subtree(v, nodes);
    }
}

bool is_beautiful(const vector<int>& P, const vector<int>& C, int root) {
    vector<int> nodes;
    collect_subtree(root, nodes);

    if (nodes[0] != root) return false;

    unordered_map<int, int> color_count;

    for (int i = 1; i < (int)nodes.size(); ++i) {
        int curr = nodes[i];
        int color = C[curr];
        int f = color_count[color];

        if (f >= i || P[curr] != nodes[f]) return false;

        color_count[color]++;
    }

    return true;
}

vector<int> beechtree(int N, int M, vector<int> P, vector<int> C) {
    for (int i = 0; i < N; ++i) {
        tree[i].clear();
    }

    for (int i = 1; i < N; ++i) {
        tree[P[i]].push_back(i);
    }

    vector<int> result(N);

    for (int i = 0; i < N; ++i) {
        result[i] = is_beautiful(P, C, i) ? 1 : 0;
    }

    return result;
}

• 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