Submission #1025575

#	Time	Username	Problem	Language	Result	Execution time	Memory
1025575		Gray	Beech Tree (IOI23_beechtree)	C++17	9 / 100	2056 ms	33472 KiB

beechtree

#include "beechtree.h"
#include <algorithm>

#define ll long long
#define ff first
#define ss second
#define ln "\n"
#define pll pair<ll, ll>
using namespace std;

vector<vector<ll>> A;
vector<int> col;
ll n, m;
void dfs(ll u, ll p, vector<ll> &child){
    child.push_back(u);
    for (auto v:A[u]){
        if (v==p) continue;
        dfs(v, u, child);
    }
}

std::vector<int> beechtree(int N, int M, std::vector<int> P, std::vector<int> C)
{
    n=N; m=M;
    A.resize(n);
    col=C;
    for (ll i=1; i<n; i++){
        A[P[i]].push_back(i);
    }
    vector<int> ans(n);
    vector<int> colus(m+1);
    for (ll i=0; i<n; i++){
        vector<ll> children;
        
        dfs(i, i, children);
        bool pos=0;
        do{
            bool ipos=1;
            for (ll j=1; j<(ll)children.size(); j++){
                if (children[colus[C[children[j]]]]!=P[children[j]]) ipos=0;
                colus[C[children[j]]]++;
            }
            for (ll j=1; j<(ll)children.size(); j++){
                colus[C[children[j]]]--;
            }
            if (ipos) {
                pos=1; break;
            }
        }while (next_permutation(children.begin()+1, children.end()));
        if (pos){
            ans[i]=1;
        }
    }
    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