Submission #1069518

#	Time	Username	Problem	Language	Result	Execution time	Memory
1069518		Malix	참나무 (IOI23_beechtree)	C++17	14 / 100	45 ms	6748 KiB

beechtree

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

#define REP(a,b,c) for(int a=b;a<c;a++)
#define PB push_back
#define F first
#define S second

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;

std::vector<int> beechtree(int n, int m, std::vector<int> p, std::vector<int> c)
{
    if(n<=8){
        vi ans(n,0);
        vii a(n);
        REP(i,0,n)a[i].PB(i);
        for(int i=n-1;i>=1;i--)for(auto u:a[i])a[p[i]].PB(u);
        vii b=a;
        REP(i,0,n){
            int s=a[i].size();
            if(s==1){
                ans[i]=1;
                continue;
            }
            map<int,int> mp;
            bool flag=1;
            REP(j,1,s){
                if(b[i][mp[c[b[i][j]]]]!=p[b[i][j]]){
                    flag=0;
                    break;
                }
                mp[c[b[i][j]]]++;
            }
            if(flag){
                ans[i]=1;
                continue;
            }
            next_permutation(b[i].begin()+1,b[i].end());
            while(b[i]!=a[i]){
                mp.clear();
                flag=1;
                REP(j,1,s){
                    if(b[i][mp[c[b[i][j]]]]!=p[b[i][j]]){
                        flag=0;
                        break;
                    }
                    mp[c[b[i][j]]]++;
                }
                if(flag)break;
                next_permutation(b[i].begin()+1,b[i].end());
            }
            if(flag)ans[i]=1;
        }
        return ans;
    }
    bool flag=1;
    REP(i,1,n)if(p[i]!=i-1)flag=0;
    if(flag){
        vi ans(n,0);
        ans[n-1]=1;
        ans[n-2]=1;
        int k=c[n-1];
        for(int i=n-2;i>=1;i--){
            if(c[i]!=k)break;
            ans[p[i]]=1;
        }
        return ans;
    }
    return {};
}

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