Submission #904983

#	Time	Username	Problem	Language	Result	Execution time	Memory
904983		Macker	Rice Hub (IOI11_ricehub)	C++14	0 / 100	12 ms	4528 KiB

ricehub

#include "ricehub.h"
#include <bits/stdc++.h>
 
using namespace std;
typedef long long ll;
typedef long double ld;
#define all(v) v.begin(), v.end()

//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")

vector<ll> v;
ll b, n;

bool can(int k){
    ll med = v[k / 2];
    ll dst = 0;
    for (int i = 0; i < k / 2; i++) {
        dst += med - v[i];
    }
    for (int i = k / 2; i < k; i++) {
        dst += v[i] - med;
    }
    
    if(dst <= b) return true;
    
    ll lmed = med;
    for (int i = k; i < n; i++) {
        med = v[(i + i - k + 1) / 2];

        dst -= med - v[i - k];
        dst += v[i] - lmed;

        if(dst <= b) return true;
        lmed = med;
    }
    return false;
}

int besthub(int R, int L, int X[], long long B)
{
    v.assign(X, X+R);
    b = B;
    n = R;
    int l = 0, r = R, mid;
    while(l < r){
        mid = (l + r + 1) / 2;
        if(can(mid)) l = mid;
        else r = mid - 1;
    }
    return l;
}

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