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>
#define ll long long
#define ff first
#define ss second
#define pb push_back
using namespace std;
vector<int>R;
int K, n;
vector<int>pref;
int getSum(int l, int r){
l++;
r++;
return pref[r] - pref[l-1];
}
void init(int k, std::vector<int> r) {
R = r;
K = k;
n = r.size();
pref.pb(0);
for(int i = 0 ; i < n ; i ++){
pref.pb(pref.back() + r[i]);
}
for(int i = 0 ; i < n ; i ++){
pref.pb(pref.back() + r[i]);
}
return;
}
int compare_plants(int x, int y) {
//cout << "ask " << x << " " << y << endl;
int ret = 0;
if(getSum(x, y-1) == 0 or getSum(y, x + n - 1) == (x+n - y)){
ret = 1;
}else if(getSum(x, y-1) == (y-x) or getSum(y, x + n-1) == 0){
ret = -1;
}
return ret;
}
# | 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... |