Submission #848822

#	Time	Username	Problem	Language	Result	Execution time	Memory
848822		rainboy	Beech Tree (IOI23_beechtree)	C++17	5 / 100	55 ms	4432 KiB

beechtree

#include "beechtree.h"

using namespace std;

typedef vector<int> vi;

vi beechtree(int n, int m, vi pp, vi cc) {
	int line = 1;
	for (int i = 1; i < n; i++)
		if (pp[i] != i - 1) {
			line = 0;
			break;
		}
	vi ans(n, 0);
	if (line) {
		ans[n - 1] = 1;
		for (int i = n - 2; i >= 0 && cc[i + 1] == cc[n - 1]; i--)
			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