# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1015694 | XJP12 | Comparing Plants (IOI20_plants) | C++14 | 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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> ii;
vi v;
vi sum;
int n;
void init(int k, vi r){
n = r.size();
//cout<<n<<endl;
sum.resize(n,0);
for(int i=0; i<n; i++){
v.push_back(r[i]);
sum[i]+=v[i];
if(i>0) sum[i]+=sum[i-1];
//cout<<sum[i]<<" ";
}
// cout<<endl;
}
int compare_plants(int x, int y){
ll ans1=0, ans2=0;
ans1=sum[y-1];
//cout<<ans1<<ans2<<endl;
if(x>0) ans1-=sum[x-1];
ans2=sum[n-1]-ans1;
//cout<<ans1<<ans2<<endl;
if(ans1==y-x || ans2==0){
return -1;
}
if(ans1==0 || ans2==n-y+x){
return 1;
}
return 0;
}