Submission #940057

#	Time	Username	Problem	Language	Result	Execution time	Memory
940057		Trisanu_Das	Beech Tree (IOI23_beechtree)	C++17	18 / 100	2037 ms	20860 KiB

beechtree

#include "beechtree.h"
#include <bits/stdc++.h>
 
using namespace std;
typedef tuple<int, int, int> piii;
 
int N, M;
vector<int> adj[202020];
vector<int> P, C;
int cnt[202020];
int idx[202020];
 
bool solve(int rt) {
    for (int i = 1; i <= M; i++) cnt[i] = 0;
    int id = 0;
    priority_queue<piii> pq;
    pq.emplace((int)adj[rt].size(), 0, rt);
    while (pq.size()) {
        int x = get<2>(pq.top()); pq.pop();
        if (x != rt) {
            if (cnt[C[x]] != idx[P[x]]) return false;
            cnt[C[x]]++;
        }
        idx[x] = id++;
        for (int i : adj[x]) pq.emplace((int)adj[i].size(), -idx[x], i);
    }
    return true;
}
 
std::vector<int> beechtree(int N, int M, std::vector<int> P, std::vector<int> C)
{
    ::N = N; ::M = M; ::P = P; ::C = C;
    vector<int> ans(N);
    for (int i = 1; i < N; i++) adj[P[i]].push_back(i);
    for (int i = 0; i < N; i++) ans[i] = solve(i);
    return ans;
}

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