Submission #573894

#TimeUsernameProblemLanguageResultExecution timeMemory
573894mosiashvililukaRice Hub (IOI11_ricehub)C++14
100 / 100
19 ms2516 KiB
#include<bits/stdc++.h> #include "ricehub.h" using namespace std; long long a,b,c,d,e,i,j,ii,jj,zx,xc,lef,rig,mid,pas,f[100009],K,E,L; void DO(long long q){ long long i=q-mid+L; long long qw=zx+L*f[i]-(mid-L)*f[i]; if(qw<=K) E=1; } int besthub(int RR, int LL, int XX[], long long BB) { a=RR;K=BB; for(i=1; i<=a; i++){ f[i]=XX[i-1]; } lef=1;rig=a+1; while(1){ if(lef+1>=rig) break; mid=(lef+rig)/2;L=mid/2+mid%2; E=0;zx=0; for(i=1; i<=mid; i++){ if(i<=L){ zx-=f[i]; }else{ zx+=f[i]; } } DO(mid); for(i=mid+1; i<=a; i++){ zx+=f[i]; zx+=f[i-mid]; j=i-mid+L; zx-=f[j];zx-=f[j]; DO(i); } if(E==0){ rig=mid; }else{ lef=mid; } } int PASUXI=lef; return PASUXI; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...