Submission #981090

#	Time	Username	Problem	Language	Result	Execution time	Memory
981090		vjudge1	Beech Tree (IOI23_beechtree)	C++17	0 / 100	1 ms	348 KiB

beechtree

#include "beechtree.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector <ll>;
using vi = vector <int>;

vi beechtree (int n, int m, vi p, vi c) {
    vector <vll> ns(n, vll({}));
    for (ll i = 0; i < n; i++) {
        ll u = p[i];
        while (u != -1) {
            ns[u].push_back(i);
            u = p[u];
        }
    }
    vi ans(n, 1);
    vector <set <ll> > vmst;
    for (ll u = n-1; u > 0; u--) {
        if (ns[u].size() == 0) continue;
        set <ll> cols;
        for (ll i : ns[u]) {
            if (cols.count(c[i])) ans[u] = 0;
            cols.insert(c[i]);
        }
        if (!ans[u]) ans[0] = 0;
        vmst.push_back(cols);
    }
    sort(vmst.begin(), vmst.end(), [&](auto a, auto b) {
        return a.size() > b.size();
    });
    for (ll i = 1; i < ll(vmst.size()); i++) {
        set <ll> st1 = vmst[i-1];
        set <ll> st2 = vmst[i];
        for (ll i : st2) ans[0] &= st1.count(i);
    }
    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