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;
int n, k;
vector<int> a, sum;
int compare_plants(int x, int y) {
if(sum[x]==sum[y-1])
return 1;
if(sum[n-1]-sum[y]==n-y-1&&(x==0||sum[x-1]==x))
return 1;
swap(x,y);
if(sum[x]==sum[y-1])
return -1;
if(sum[n-1]-sum[y]==n-y-1&&(x==0||sum[x-1]==x))
return -1;
return 0;
}
void init(int K, vector<int> r) {
n=(int)r.size(), k=K, a=r, sum=a, partial_sum(sum.begin(), sum.end(), sum.begin());
}
/*int main() {
init(2, {0, 1, 0, 1});
cout << compare_plants(1, 3);
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... |