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"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, S[200200];
void init(int k, vector<int> r) {
n = r.size();
S[0] = r[0];
for (int i=1;i<(int)r.size();i++) S[i] = S[i-1]+r[i];
}
int compare_plants(int x, int y) {
int v, w, l, m;
bool chk = x>y;
if (x>y) swap(x, y);
v = S[y-1] - (x?S[x-1]:0), l = y-x;
w = S[n-1]-v, m = n-l;
if (chk) swap(v, w), swap(l, m);
if (!v || w==m) return 1;
if (v==l || !w) 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... |