Submission #1066765

#	Time	Username	Problem	Language	Result	Execution time	Memory
1066765		pcc	참나무 (IOI23_beechtree)	C++17	0 / 100	1 ms	348 KiB

beechtree

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

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

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