Submission #1058377

#	Time	Username	Problem	Language	Result	Execution time	Memory
1058377		Triseedot	Beech Tree (IOI23_beechtree)	C++17	9 / 100	2088 ms	17492 KiB

beechtree

// 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]]++;
        }
    }
    debug(bad);
    
    auto calc = [&] (int root) {
        debug(root);
        int k = 0;
        vector<int> cnt(N, 0), last(N, 0);
        vector<vector<int>> q(N), order(N);
        bool f = false;
        function<void(int)> calc_cnt = [&] (int v) {
            if (bad[v]) f = true;
            if (v != root) {
                if (cnt[C[v]] == 0) k++;
                cnt[C[v]]++;
            }
            for (int u : g[v]) {
                calc_cnt(u);
            }
        };
        calc_cnt(root);
        if (f) return false;
        debug(k);
        
        q[len(g[root])].push_back(root);
        while (k > 0 && !q[k].empty()) {
            int v = q[k].back();
            q[k].pop_back();
            debug(v);
            
            if (v != root) {
                last[C[v]]++;
                if (len(order[C[v]]) - 1 >= last[C[v]]) {
                    int u = order[C[v]][last[C[v]]];
                    q[len(g[u])].push_back(u);
                }
            }
            for (int u : g[v]) {
                order[C[u]].push_back(u);
                if (len(order[C[u]]) - 1 == last[C[u]]) {
                    int w = order[C[u]][last[C[u]]];
                    q[len(g[w])].push_back(w);
                }
                
                cnt[C[u]]--;
                if (cnt[C[u]] == 0) k--;
            }
        }
        debug(k, q);
        return k == 0;
    };
    
    vector<int> res(N);
    for (int i = 0; i < N; i++) res[i] = calc(i);
    return res;
}

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