Submission #16774

#	Time	Username	Problem	Language	Result	Execution time	Memory
16774		atomzeno	Rice Hub (IOI11_ricehub)	C++98	0 / 100	27 ms	5380 KiB

ricehub

#include "ricehub.h"
#include<algorithm>
#define MX 100004
using namespace std;
int x[MX],n;
long long int r=1,BB,s;
int OK(int X){
    int i,dd=X-(X/2),ee=(X/2);
    s=0;
    for(i=1;i<=ee;i++){
        s+=((long long int)x[i+dd]-x[i]);
    }
    if(s<=BB){return 1;}
    for(i=2;i<=n-X+1;i++){
        s+=(x[i+dd]-x[i])-(x[i+dd-1]-x[i-1]);
        if(s<=BB){return 1;}
    }
    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;
        if(OK(m)==1){s=m;}
        else{e=m;}
    }
}

• Subtask 1: 0 / 17
• Subtask 2: 0 / 25
• Subtask 3: 0 / 26
• Subtask 4: 0 / 32