제출 #841446

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
841446		model_code	참나무 (IOI23_beechtree)	C++17	0 / 100	2072 ms	27036 KiB

beechtree

// failed/subtask-smallN-wa1.cpp

#include "beechtree.h"

#include <set>
#include <algorithm>

using namespace std;
using pii = pair<int, int>;

int n, m;
vector<int> par;
vector<set<int>> ch_colors;
vector<int> t;

bool is_subset(int x, int y)
{
    if (ch_colors[x].size() > ch_colors[y].size())
        swap(x, y);
    for (int c : ch_colors[x])
    {
        if (!ch_colors[y].count(c))
            return false;
    }
    return true;
}

void solve(int r)
{
    vector<int> subtree = {r};
    for (int u = r + 1; u < n; ++u)
    {
        if (ch_colors[u].size() == 0)
            continue;
        if (binary_search(subtree.begin(), subtree.end(), par[u]))
        {
            if (t[u] == 0)
            {
                t[r] = 0;
                return;
            }
            subtree.push_back(u);
        }
    }
    int k = subtree.size();
    for (int i = 0; i + 1 < k; ++i)
    {
        for (int j = i + 1; j < k; ++j)
        {
            int x = subtree[i], y = subtree[j];
            if (!is_subset(x, y))
            {
                t[r] = 0;
                return;
            }
        }
    }
}

std::vector<int> beechtree(int N, int M, std::vector<int> P, std::vector<int> C)
{
    n = N, m = M, par = P;
    ch_colors.assign(N, {});
    t.assign(N, 1);
    for (int v = 1; v < N; ++v)
    {
        int u = P[v];
        if (ch_colors[u].count(C[v]))
        {
            t[u] = 0;
        }
        ch_colors[u].insert(C[v]);
    }
    for (int r = N - 1; r >= 0; --r)
    {
        solve(r);
    }

    return t;
}

• 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