Submission #1003264

#	Time	Username	Problem	Language	Result	Execution time	Memory
1003264		vjudge1	Rice Hub (IOI11_ricehub)	C++17	25 / 100	66 ms	600 KiB

ricehub

#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define pll pair<ll, ll>
ll p[5005];
 
pll binary1(ll b, ll e, ll num, ll money)
{
    ll l = b, r = e, ans = 0;
    while (l <= r){
        ll m = (l + r)/2;
        if (p[m] - p[b-1] - ((m-b+1)*num) <= money){
            l = m + 1;
            ans = money - (p[m] - p[b-1] - ((m-b+1)*num));
        }
        else {
            r = m - 1;
        }
    }
    return {ans, l-1};
}
 
pll binary2(ll b, ll e, ll num, ll money)
{
    ll l = b, r = e, ans = 0;
    while (l <= r){
        ll m = (l + r)/2;
        if ((e-m+1)*num - (p[e] - p[m-1]) <= money){
            r = m - 1;
            ans = money - (e-m+1)*num - (p[e] - p[m-1]);
        }
        else {
            l = m + 1;
        }
    }
    return {ans, r+1};
}
 
int besthub(int n, int l, int a[], long long b)
{
    for (ll i = 0; i<n; i++){
        p[i+1] = p[i] + a[i];
    }
    ll mx = 0;
    for (ll i = 1; i<=l; i++){
        ll x = lower_bound(a, a+n, i) - a;
        pll k = binary1(x+1, n, i, b);
        pll g = binary2(1, x, i, k.first);
        mx = max(mx, (k.second-g.second+1));
        g = binary2(1, x, i, b);
        k = binary1(x+1, n, i, g.first);
        mx = max(mx, (k.second-g.second+1));
    }
    return mx;
}

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