Submission #16775

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
167752015-09-25 13:48:39atomzenoRice Hub (IOI11_ricehub)C++98
100 / 100
26 ms6552 KiB
#include "ricehub.h"
#include<algorithm>
#define MX 100004
using namespace std;
long long int x[MX],n,GER[MX];
long long int r=1,BB;
int OK(long long int X){
long long int i,dd=(X+1)/2,cnt=0,ee=(X/2),s=0;
for(i=1;i<=(n-dd);i++){
GER[i]=x[i+dd]-x[i];
}
for(i=1;i<=ee;i++){s+=GER[i];}
if(s<=BB)return 1;
for(i=ee+1;i<=(n-dd);i++){
s+=GER[i];
s-=GER[i-ee];
if(s<=BB)return 1;
}
if(s<=BB)return 0;
}
int besthub(int R, int L, int X[], long long B){
n=R;
int s=0,e=n+1,m;
BB=B;
int i;
for(i=1;i<=n;i++){x[i]=X[i-1];}
sort(x+1,x+1+n);
for(;;){
if((s+1)==e)return s;
m=(s+e)/2;
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...