This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "plants.h"
using namespace std;
typedef vector<int> vi;
const int N = 200000;
int pp[N], n, k;
void init(int k_, vi rr) {
int i;
n = rr.size(), k = k_;
for (i = 0; i < n; i++)
pp[i] = rr[i];
for (i = 1; i < n; i++)
pp[i] += pp[i - 1];
}
int compare_plants(int x, int y) {
int k = pp[y - 1] - (x == 0 ? 0 : pp[x - 1]);
if (k == y - x)
return -1;
else if (k == 0)
return 1;
k = pp[n - 1] - k;
if (k == n - (y - x))
return 1;
else if (k == 0)
return -1;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |