제출 #1038892

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1038892		fv3	참나무 (IOI23_beechtree)	C++17	9 / 100	55 ms	17604 KiB

beechtree

#include <bits/stdc++.h>
#include "beechtree.h"

using namespace std;

vector<int> beechtree(int N, int M, vector<int> P, vector<int> C)
{
    vector<int> b(N);
    vector<vector<int>> adj(N);

    for (int i = 1; i < N; i++)
    {
        adj[P[i]].push_back(i);
    }

    map<int, int> colourCnt;
    for (auto node : adj[0])
    {
        b[node] = 1;
        set<int> childColours;
        for (auto e : adj[node])
        {
            if (childColours.count(C[e])) 
                b[node] = 0;
            childColours.insert(C[e]);
            colourCnt[C[e]]++;
            b[e] = 1;
        }
    }

    b[0] = 1;
    set<int> childColours;
    map<int, int> ncnt;
    for (auto node : adj[0])
    {
        if (!b[node] || childColours.count(C[node]))
        {
            b[0] = 0;
            break;
        } 
        childColours.insert(C[node]);
        ncnt[C[node]]++;
    }

    vector<int> cnts;
    for (auto n : colourCnt)
    {
        if (childColours.count(n.first) == 0)
        {
            b[0] = 0;
            break;
        }
        cnts.push_back(n.second);
    }

    vector<pair<int, int>> pi;
    for (auto node : adj[0])
    {
        pi.push_back({adj[node].size(), node});
    }

    sort(pi.begin(), pi.end());
    reverse(pi.begin(), pi.end());

    int d = 1;
    for (auto subtree : pi)
    {
        for (auto node : adj[subtree.second])
        {
            if (ncnt[C[node]]++ != d)
            {
                b[0] = 0;
                return b;
            }
        }

        d++;
    }

    return b;
}

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