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;
const int NN=2e5+100;
int pre[NN];
int nn;
void init(int k,vector<int> r){
nn=r.size();
for(int i=1;i<=nn;i++){
pre[i]=pre[i-1]+r[i-1];
}
}
int compare_plants(int x, int y){
x++;y++;
if(pre[y-1]-pre[x-1]==0)return 1;
if(pre[y-1]-pre[x-1]==y-x)return -1;
if(pre[x-1]+pre[nn]-pre[y-1]==0){
return -1;
}
if(pre[x-1]+pre[nn]-pre[y-1]==x-1+nn-y+1){
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... |