Submission #1046476

#	Time	Username	Problem	Language	Result	Execution time	Memory
1046476		0npata	Beech Tree (IOI23_beechtree)	C++17	5 / 100	33 ms	6844 KiB

beechtree

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

#define vec vector

std::vector<int> beechtree(int N, int M, std::vector<int> P, std::vector<int> C)
{
	vec<int> ans(N);
	ans[N-1] = 1;
	ans[N-2] = 1;
	for(int i = N-3; i>=0; i--) {
		ans[i] = ans[i+1] & (C[i+1] == C[i+2]);
	}
    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