Submission #1074731

#	Time	Username	Problem	Language	Result	Execution time	Memory
1074731		Unforgettablepl	Beech Tree (IOI23_beechtree)	C++17	5 / 100	44 ms	6740 KiB

beechtree

#include "beechtree.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> beechtree(int N,int M,vector<int> P,vector<int> C){
    vector<int> ans(N);
    for(int i=N-2;i>=0;i--) {
        if(C[i]!=C[i+1]) {
            for(int j=i;j<N;j++)ans[j]=1;
            return ans;
        }
    }
    assert(false);
}

• 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