# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
411143 | eagle30 | Comparing Plants (IOI20_plants) | C++17 | 0 ms | 0 KiB |
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 pref[1000000], n, tot=0;
void init(int k, vector<int> r) {
n=r.size();
for(int i=0; i<n; i++){
tot+=r[i];
pref[i+1]=pref[i]+r[i];
}
return;
}
int compare_plants(int x, int y) {
int u=pref[y]-pref[x];
assert(1)
if(u==y-x)
return -1;
else if(u==0){
return 1;
}
else{
assert(1);
return 0;
}
}