Submission #1067659

#	Time	Username	Problem	Language	Result	Execution time	Memory
1067659		vjudge1	Beech Tree (IOI23_beechtree)	C++17	9 / 100	2058 ms	11320 KiB

beechtree

#include "beechtree.h"
#include<bits/stdc++.h>
using namespace std;
int check(vector<int>v,vector<int>P,vector<int>C){
    map<int,int>mp;
    for(int i=1;i<v.size();i++)
        if(v[mp[C[v[i]]]++]!=P[v[i]])
            return 0;
    return 1;
}
vector<int>sub[10010];
vector<int> beechtree(int N, int M, vector<int> P, vector<int> C){
    vector<int> V(N);
    for(int i=N;i--;){
        sub[i].push_back(i);
        sort(sub[i].begin(),sub[i].end());
        do{
            if(check(sub[i],P,C))
                V[i]=1;
        } while(next_permutation(sub[i].begin()+1,sub[i].end()));
        if(P[i]>=0)
            for(auto d:sub[i])
                sub[P[i]].push_back(d);
    }
    return V;
}

Compilation message (stderr)

beechtree.cpp: In function 'int check(std::vector<int>, std::vector<int>, std::vector<int>)':
beechtree.cpp:6:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    6 |     for(int i=1;i<v.size();i++)
      |                 ~^~~~~~~~~

• 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