Submission #1078163

#	Time	Username	Problem	Language	Result	Execution time	Memory
1078163		MohamedFaresNebili	Beech Tree (IOI23_beechtree)	C++17	0 / 100	1 ms	348 KiB

beechtree

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

        using namespace std;

        vector<int> beechtree(int N, int M, vector<int> _P, vector<int> C) {
            vector<int> ans(N, 0);
            vector<int> P(N, 0);
            for(int l = 2; l < N; l++) P[l] = P[l - 1] + (C[l] == C[l - 1]);
            for(int l = 0; l < N; l++) {
                if(P[N - 1] - P[l] == N - l - 1)
                    ans[l] = 1;
            }
            return ans;
        }

• 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