Submission #1078114

#	Time	Username	Problem	Language	Result	Execution time	Memory
1078114		MohamedFaresNebili	Beech Tree (IOI23_beechtree)	C++17	0 / 100	2092 ms	4956 KiB

beechtree

#include <bits/stdc++.h>
#include "beechtree.h"

        using namespace std;

        vector<int> adj[200005];

        void getSub(int v, vector<int>& sub) {
            sub.push_back(v);
            for(auto u : adj[v])
                getSub(u, sub);
        }

        vector<int> beechtree(int N, int M, vector<int> P, vector<int> C) {
            vector<int> ans(N, 0);
            for(int l = 0; l < N; l++) adj[l].clear();
            for(int l = 1; l < N; l++)
                adj[P[l]].push_back(l);
            for(int l = 0; l < N; l++) {
                vector<int> sub; getSub(l, sub);
                sort(sub.begin() + 1, sub.end());
                do {
                    bool ok = true;
                    vector<int> cur(M, 0);
                    for(int i = 0; i < sub.size() && ok; i++) {
                        if(i > 0) ok &= (P[sub[i]] == sub[cur[C[sub[i]]]]);
                        cur[C[sub[i]]]++;
                    }
                    if(ok) { ans[l] = 1; break; }
                } while(!next_permutation(sub.begin() + 1, sub.end()));
            }
            return ans;
        }

Compilation message (stderr)

beechtree.cpp: In function 'std::vector<int> beechtree(int, int, std::vector<int>, std::vector<int>)':
beechtree.cpp:25:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |                     for(int i = 0; i < sub.size() && ok; i++) {
      |                                    ~~^~~~~~~~~~~~

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