# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
504057 | Newtech66 | Rice Hub (IOI11_ricehub) | C++17 | 13 ms | 2524 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;
using lol=long long int;
bool ok(const vector<lol>& p,int n,lol B,int k)
{
auto query=[&](int l,int r){
if(l>r) return 0ll;
return p[r]-(l?p[l-1]:0);
};
for(int i=0;i+k-1<n;i++)
{
int pos=i+k/2;
lol chk=0;
if(i<=pos) chk+=(pos-i+1)*query(pos,pos)-query(i,pos);
if(pos+1<=i+k-1) chk+=query(pos+1,i+k-1)-(i+k-1-pos)*query(pos,pos);
if(chk<=B) return true;
}
return false;
}
int besthub(int R,int L,int X[],lol B)
{
vector<lol> p{X,X+R};
partial_sum(p.begin(),p.end(),p.begin());
int l=1,r=R,mid,ans;
while(l<=r)
{
mid=l+(r-l)/2;
if(ok(p,R,B,mid))
Compilation message (stderr)
# | 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... |