Submission #898750

#	Time	Username	Problem	Language	Result	Execution time	Memory
898750		Samot19	Rice Hub (IOI11_ricehub)	C++14	0 / 100	10 ms	2672 KiB

ricehub

#include <iostream>
#include <cmath>

typedef long long ll;

using namespace std;

bool solve(ll m, ll r, int x[], ll b) {

    ll xd = 0;

    for(int i=0; i<m; i++) {
        xd+=abs(x[m/2]-x[i]);
    }

    if(xd <= b) {
        return true;
    }

    for(ll i = 1; i < r-m; i++) {
        xd-=(x[m/2+i-1]-x[i-1]);
        xd+=(x[m+i]-x[m/2+i]);
        xd-=(x[m/2+i]-x[m/2+i-1])*(m%2);

        if(xd <= b) return true;
    }

    return false;
}

ll besthub(int r, int l, int x[], long long b) {

    ll u = 0;
    ll m;
    ll v = r;

    while(u < v) {
        m = ceil((u+v)/2.0);

        if(solve(m, r, x, b)) {
            u = m;
        }
        else {
            v = m-1;
        }
    }


    return u;

}

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