Submission #1232875

#	Time	Username	Problem	Language	Result	Execution time	Memory
1232875		antonn	Beech Tree (IOI23_beechtree)	C++20	5 / 100	38 ms	4932 KiB

beechtree

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

using namespace std;

typedef long long ll;

const int N = 2e5 + 7;

int n, m;
int ok[N];

vector<int> beechtree(int N, int M, vector<int> P, vector<int> C) {
    n = N;
    m = M;
    int ptr = n - 1;
    while (ptr >= 1 && C[ptr] == C[n - 1]) {
        ok[ptr] = 1;
        --ptr;
    }
    ok[ptr] = 1;
    vector<int> ret(n);
    for (int i = 0; i < n; ++i) ret[i] = ok[i];
    return ret; 
}

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