Submission #1067660

#	Time	Username	Problem	Language	Result	Execution time	Memory
1067660		vjudge1	Beech Tree (IOI23_beechtree)	C++17	5 / 100	47 ms	6744 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> V(N);
    V[N-1]=1;
    V[N-2]=1;
    for(int i=N-2;i--;)
        V[i]=V[i+1]&&(C[i+2]==C[i+1]);
    return V;
}

• 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