# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
101106 | ansol4328 | Rice Hub (IOI11_ricehub) | C++11 | 5 ms | 384 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<stdio.h>
bool pos(int del, int *m, long long B, int n)
{
int cnt=n-del;
int hcnt=cnt/2;
long long d=0;
for(int i=0 ; i<cnt/2 ; i++) d+=(long long)m[cnt-i+1]-m[i];
if(d<=B) return true;
for(int i=0 ; i<n-cnt ; i++)
{
int didx=i, aidx=i+cnt;
d-=(long long)m[didx+hcnt]-m[didx];
d+=(long long)m[aidx]-m[aidx-hcnt];
if(d<=B) return true;
}
return false;
}
int besthub(int R, int L, int *X, long long B)
{
int st=0, fn=R, mid, res;
while(st<=fn)
{
mid=(st+fn)>>1;
if(pos(mid,X,B,R)) fn=mid-1, res=mid;
else st=mid+1;
}
return R-res;
}
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... |