Submission #768977

#	Time	Username	Problem	Language	Result	Execution time	Memory
768977		t6twotwo	Comparing Plants (IOI20_plants)	C++17	0 / 100	2 ms	212 KiB

plants

#include "plants.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int N, K;
vector<int> H, pfs;
void init(int k, std::vector<int> r) {
	K = k, H = r; N = H.size();
	pfs.resize(N + 1);
	for (int i = 0; i < N; i++) {
		pfs[i + 1] = pfs[i] + H[i];
	}
}

int compare_plants(int x, int y) {
	if (pfs[y + 1] - pfs[x + 1] == 0) {
		return 1;
	}
	if (pfs[y + 1] - pfs[x + 1] == y - x) {
		return -1;
	}
	if (pfs[N] - pfs[y] + pfs[x] == 0) {
		return -1;
	}
	if (pfs[N] - pfs[y] + pfs[x] == N - y + x) {
		return 1;
	}
	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