Submission #1233908

#	Time	Username	Problem	Language	Result	Execution time	Memory
1233908		mariza	Beech Tree (IOI23_beechtree)	C++20	5 / 100	39 ms	4168 KiB

beechtree

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

using namespace std;
typedef long long ll;

vector<int> beechtree(int n, int m, vector<int> p, vector<int> c){
    vector<int> ans(n,0);

    ans[n-1]=1;
    ans[n-2]=1;
    ll i=n-3;
    while(i>=0 && c[i+1]==c[i+2]){
        ans[i]=1;
        i--;
    }

    return ans;
}

• 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