Submission #841410

#	Time	Username	Problem	Language	Result	Execution time	Memory
841410		model_code	Beech Tree (IOI23_beechtree)	C++17	8 / 100	117 ms	53208 KiB

beechtree

// correct/subtask-colorTwice-1.cpp

#include "beechtree.h"

#include <set>

using namespace std;

vector<int> t, dep;
vector<vector<int>> ch;
vector<set<int>> ch_colors;

void dfs(int u)
{
    int cnt1 = 0, v1 = 0;
    for (int v : ch[u])
    {
        dfs(v);
        dep[u] = max(dep[u], dep[v] + 1);
        if (dep[v] == 1)
        {
            ++cnt1;
            v1 = v;
        }
    }
    if (dep[u] < 2)
        return;
    if (dep[u] > 2 || (dep[u] == 2 && cnt1 > 1))
    {
        t[u] = 0;
        return;
    }
    for (int c : ch_colors[v1])
    {
        if (!ch_colors[u].count(c))
            t[u] = 0;
    }
}

vector<int> beechtree(int N, int /*M*/, vector<int> P, vector<int> C)
{
    t.assign(N, 1);
    ch.assign(N, {});
    ch_colors.resize(N);
    for (int v = 1; v < N; ++v)
    {
        int u = P[v], c = C[v];
        if (ch_colors[u].count(c))
            t[u] = false;
        ch[u].push_back(v);
        ch_colors[u].insert(c);
    }
    dep.assign(N, 0);
    dfs(0);

    return t;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 9
• Subtask 2: 0 / 5
• Subtask 3: 0 / 9
• Subtask 4: 8 / 8
• Subtask 5: 0 / 14
• Subtask 6: 0 / 14
• Subtask 7: 0 / 12
• Subtask 8: 0 / 17
• Subtask 9: 0 / 12