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 <bits/stdc++.h>
#define N 200009
#define pii pair <int, int>
#define ff first
#define sz() size()
#define ss second
#define sz() size()
#define pb push_back
#define ll long long
using namespace std;
int v[N], n;
void init(int k, vector<int>r){
n=r.sz();
for(int i=0; i<n; i++)
v[i]=r[i], v[i]+=v[i-1];
}
int compare_plants(int x, int y){
if(x>y)
swap(x, y);
if(v[y-1]-v[x-1]==0 or (v[x-1]+v[n-1]-v[y-1]==x+n-y+1))
return 1;
else if(v[y-1]-v[x-1]==y-x or (v[x-1]==0 and v[n-1]-v[y-1]==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... |