Submission #1233878

#	Time	Username	Problem	Language	Result	Execution time	Memory
1233878		MuhammadSaram	Beech Tree (IOI23_beechtree)	C++17	5 / 100	38 ms	4168 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);
	ans[n-1]=1;
	for (int i=n-2;i>=0;i--)
		if (c[i+1]!=c[n-1])
			break;
		else
			ans[i]=1;
	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