Submission #425776

#	Time	Username	Problem	Language	Result	Execution time	Memory
425776		erekle	Comparing Plants (IOI20_plants)	C++17	5 / 100	104 ms	5852 KiB

plants

#include "plants.h"
#include <bits/stdc++.h>

using namespace std;

vector<int> cntGreater; // how many following this are greater than this
vector<int> cntLess; // how many following this are less than this

int n;
void init(int k, std::vector<int> r) {
	n = r.size();

	cntGreater.resize(n);
	int i = 0;
	while (r[i] == 1) ++i;
	cntGreater[i] = 0;
	for (int j = (i-1+n)%n; j != i; j = (j-1+n)%n) {
		if (r[j] == 1) cntGreater[j] = cntGreater[(j+1)%n] + 1;
		else cntGreater[j] = 0;
	}

	cntLess.resize(n);
	i = 0;
	while (r[i] == 0) ++i;
	cntLess[i] = 0;
	for (int j = (i-1+n)%n; j != i; j = (j-1+n)%n) {
		if (r[j] == 0) cntLess[j] = cntLess[(j+1)%n] + 1;
		else cntLess[j] = 0;
	}

	return;
}

int compare_plants(int x, int y) {
	if (cntGreater[x] >= y-x) return -1;
	if (cntLess[x] >= y-x) return 1;
	if (cntGreater[y] >= n+x-y) return 1;
	if (cntLess[y] >= n+x-y) return -1;
	return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 14
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 11
• Subtask 6: 0 / 15
• Subtask 7: 0 / 25