Submission #516273

#	Time	Username	Problem	Language	Result	Execution time	Memory
516273		Jesus	Rice Hub (IOI11_ricehub)	C++14	0 / 100	3 ms	460 KiB

ricehub

#include <iostream>
#include "ricehub.h"

using namespace std;

int besthub(int R, int L,int X[], long long int B){
    long long int izq=0, der=0, maxim=0;
    long long int costo=0;
    int i=0,j=0;
    int z=0;
    while(i<R){
        if(j==R-1||costo>B) {
                if(izq<der){
                    z=(i+j)/2;
                    costo-=X[z+1]-X[z-izq];
                    costo+=(X[z+1]-X[z])*(izq);
                    costo-=(X[z+1]-X[z])*(der);
                    izq++;
                    der--;

                }
                i++;
                izq--;
        }
        else{
            z=(i+j)/2;
            if(izq<der){
                costo+=X[z+1+der]-X[z+1];
                costo+=(X[z+1]-X[z])*izq;
                costo-=(X[z+1]-X[z])*(der-1);
                izq++;
                der--;
            }
            else{
                costo+=X[z+der+1]-X[z];
            }
            j++;
            der++;
        }
        if(costo<=B) maxim=max(maxim,der+izq+1);

    }
    return maxim;
}

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