Submission #768979

#TimeUsernameProblemLanguageResultExecution timeMemory
768979t6twotwoComparing Plants (IOI20_plants)C++17
5 / 100
60 ms8680 KiB
#include "plants.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int N, K;
vector<int> R, pfs;
void init(int k, std::vector<int> r) {
	K = k, R = r; N = R.size();
	pfs.resize(N + 1);
	for (int i = 0; i < N; i++) {
		pfs[i + 1] = pfs[i] + R[i];
	}
}

int compare_plants(int x, int y) {
	if (pfs[y] - pfs[x] == 0) {
		return 1;
	}
	if (pfs[y] - pfs[x] == 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;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...