Submission #1291773

#	Time	Username	Problem	Language	Result	Execution time	Memory
1291773		lucaskojima	Comparing Plants (IOI20_plants)	C++17	0 / 100	1 ms	572 KiB

plants

#include "bits/stdc++.h"
#include "plants.h"
#define sz(x) (int)size(x)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)

using namespace std;
using ll = long long;
using pii = pair<int, int>;

const char nl = '\n';
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;

vector<int> r, pref;
int n, k;

void init(int k_, vector<int> r_) {
	n = sz(r_);
	k = k_;
	r = r_;

	pref.resize(n);
	pref[0] = r[0];
	for (int i = 1; i < n; i++)
		pref[i] = pref[i - 1] + r[i];

	return;
}

int compare_plants(int i, int j) {
	if (i < j) {
		int sum = pref[j] - (i == 0 ? 0 : pref[i - 1]);
		if (sum == 0)
			return 1;
		if (sum == j - i + 1)
			return -1;
		return 0;
	} else {
		int sum = pref[n - 1] - (i == 0 ? 0 : pref[i - 1]) + pref[j];
		if (sum == 0)
			return 1;
		if (sum == n - i + j + 1)
			return -1;
		return 0;
	}
	return 0;
}

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