# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1015697 | 2024-07-06T16:42:51 Z | XJP12 | Comparing Plants (IOI20_plants) | C++14 | 0 ms | 0 KB |
#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, int 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; }