Submission #1188420

#	Time	Username	Problem	Language	Result	Execution time	Memory
1188420		MatteoArcari	Beech Tree (IOI23_beechtree)	C++20	0 / 100	1 ms	328 KiB

beechtree

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

vector<int> beechtree(int n, int m, vector<int> p, vector<int> c) {
    vector<vector<int>> adj(n);
    for (int i = 1; i < n; i++) {
        adj[p[i]].push_back(i);
    }
    vector<int> ans(n);
    vector<int> maxD(n);
    vector<set<int>> col(n);
    auto dfs = [&](auto &&dfs, int i) -> void {
        for (int j: adj[i]) {
            dfs(dfs, j);
            maxD[i] = max(maxD[i], maxD[j] + 1);
            col[i].insert(c[j]);
        }
        if (maxD[i] == 0) {
            ans[i] = 1;
        }
        if ((maxD[i] == 1 || maxD[i] == 2) && adj[i].size() == col[i].size()) {
            ans[i] = 1;
        }
    }; dfs(dfs, 0);
    return ans;
}

• 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