Submission #841429

#	Time	Username	Problem	Language	Result	Execution time	Memory
841429		model_code	Beech Tree (IOI23_beechtree)	C++17	0 / 100	1 ms	292 KiB

beechtree

// incorrect/subtask-shallow-wa3.cpp

#include "beechtree.h"

#include <set>
#include <algorithm>

using namespace std;

vector<int> beechtree(int N, int /*M*/, vector<int> P, vector<int> C)
{
    vector<set<int>> ch_colors(N);
    vector<int> t(N, 1);
    for (int v = 1; v < N; ++v)
    {
        int u = P[v], c = C[v];
        ch_colors[u].insert(c);
    }

    vector<int> ord(N);
    for (int i = 0; i < N; ++i)
        ord[i] = i;
    sort(ord.begin(), ord.end(), [&](int u, int v)
         {
        if (ch_colors[u].size() != ch_colors[v].size())
            return ch_colors[u].size() < ch_colors[v].size();
        return u > v; });
    if (ord[N - 1] != 0)
        t[0] = false;
    for (int i = 0; i + 1 < N; ++i)
    {
        int u = ord[i], v = ord[i + 1];
        for (int c : ch_colors[u])
        {
            if (!ch_colors[v].count(c))
                t[0] = false;
        }
    }

    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