This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// In honor of El Psy Congroo
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#else
#define debug(...)
#endif
using ll = long long;
#define all(v) v.begin(), v.end()
#define len(v) int(v.size())
vector<int> beechtree(int N, int M, vector<int> P, vector<int> C) {
vector<vector<int>> g(N);
for (int u = 1; u < N; u++) {
int v = P[u];
g[v].push_back(u);
}
auto compress = [] (vector<int> &a) {
int n = len(a);
vector<pair<int, int>> b(n);
for (int i = 0; i < n; i++) {
b[i] = {a[i], i};
}
sort(all(b));
int curr = 0;
for (int i = 0; i < n; i++) {
if (i != 0 && b[i].first != b[i - 1].first) curr++;
a[b[i].second] = curr;
}
};
compress(C);
vector<bool> bad(N, false);
for (int v = 0; v < N; v++) {
vector<int> cnt(N, 0);
for (int u : g[v]) {
if (cnt[C[u]]) bad[v] = true;
cnt[C[u]]++;
}
}
vector<int> cnt(N, 0), cnt_leaf(N, 0);
vector<vector<int>> q(N + 1);
auto calc = [&] (int root) {
int curr = 0;
function<void(int)> calc_cnt = [&] (int v) {
if (len(g[v]) == 0) {
cnt_leaf[C[v]]++;
}
for (int u : g[v]) {
if (cnt[C[u]] == 0) curr++;
cnt[C[u]]++;
calc_cnt(u);
}
};
function<void(int)> reset = [&] (int v) {
cnt[C[v]] = 0;
cnt_leaf[C[v]] = 0;
q[len(g[v])].clear();
for (int u : g[v]) {
reset(u);
}
};
calc_cnt(root);
q[len(g[root])].push_back(root);
while (!q[curr].empty() && curr > 0) {
int v = q[curr].back();
q[curr].pop_back();
if (bad[v]) continue;
for (int u : g[v]) {
cnt[C[u]]--;
if (cnt[C[u]] == 0) {
curr--;
}
q[len(g[u])].push_back(u);
}
}
reset(root);
return curr == 0;
};
vector<int> res(N);
for (int i = 0; i < N; i++) res[i] = calc(i);
return res;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |