제출 #1031546

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1031546		aaaaaarroz	Beech Tree (IOI23_beechtree)	C++17	17 / 100	98 ms	63168 KiB

beechtree

#include "beechtree.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> t, depth;
vector<vector<int>> ch;
vector<set<int>> ch_colors;
bool orden(int x, int y){
	if (ch_colors[x].size() != ch_colors[y].size())
            return ch_colors[x].size() < ch_colors[y].size();
        return x > y;
}
void dfs(int u){
    for (int v : ch[u]){
        dfs(v);
        depth[u] = max(depth[u], depth[v] + 1);
        if (t[v] == 0)
            t[u] = 0;
    }
    if (depth[u] != 2){
        if (depth[u] > 2)
            t[u] = 0;
        return;
    }
    vector<int> ord = ch[u];
    ord.push_back(u);
    sort(ord.begin(), ord.end(),orden);
    if (ord.back() != u)
        t[u] = 0;
    for (int i = 0; i + 1 < (int)ord.size(); ++i)
    {
        int x = ord[i], y = ord[i + 1];
        for (int c : ch_colors[x])
        {
            if (!ch_colors[y].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);
    }
    depth.assign(N, 0);
    dfs(0);
    return t;
}

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