제출 #1242552

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1242552		bangan	Beech Tree (IOI23_beechtree)	C++20	9 / 100	2097 ms	72264 KiB

beechtree

#include "beechtree.h"
#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define ALL(a) a.begin(), a.end()

vector<int> beechtree(int n, int m, vector<int> p, vector<int> c) {
    vector<vector<int>> adj(n);
    for (int i=1; i<n; i++) adj[p[i]].pb(i);

    vector<int> ans(n), h(n);
    auto dfs = [&](auto self, int v) -> vector<int> {
        vector<int> sub{v};
        for (auto u : adj[v]) {
            h[u] = h[v]+1;
            auto vec = self(self, u);
            for (auto it : vec) sub.pb(it);
        }

        sort(ALL(sub));
        do {
            if (sub[0] != v) continue;
            
            bool valid = true;
            for (int i=1; i<sub.size(); i++) {
                int f=0;
                for (int j=1; j<i; j++) f += c[sub[i]]==c[sub[j]];
                if (sub[f] != p[sub[i]]) valid = false;
            }

            int r = sub.size();
            while (0 <= r-1 && adj[sub[r-1]].empty()) r--;
            for (int i=0; i+1 < r; i++) if (h[sub[i]] > h[sub[i+1]]) valid = false;
            for (int i=0; i<r; i++) if (adj[sub[i]].empty()) valid = false;

            if (valid) ans[v] = 1;

        } while (next_permutation(ALL(sub)));
        
        return sub;
    };
    dfs(dfs, 0);

    return ans;
}

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