Submission #556267

#	Time	Username	Problem	Language	Result	Execution time	Memory
556267		Dan4Life	쌀 창고 (IOI11_ricehub)	C++17	0 / 100	4 ms	468 KiB

ricehub

#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long

ll pref[100010];

ll sum(int i, int j){ return pref[j+1]-pref[i]; }

int besthub(int n, int m, int a[], ll k)
{
    pref[0] = 0;
    for(int i = 0; i < n; i++)
        pref[i+1] = pref[i]+(ll)a[i];
    int l = 1, r = n;
    while(l<r){
        int mid = (l+r+1)/2; ll mn = (ll)4e18;
        for(int i = 0; i <= n-mid; i++){
            int j = i+mid-1; int med = (i+j)/2;
            ll sum1 = (ll)a[med]*(med-i+1)-sum(i,med);
            ll sum2 = sum1+sum(med+1,j)-a[med]*(j-med);
            mn = min(mn, sum1+sum2);
            if(med-1>=i){
                med--;
                sum1 = (ll)a[med]*(med-i+1)-sum(i,med);
                sum2 = sum1+sum(med+1,j)-a[med]*(j-med);
                mn = min(mn, sum1+sum2), med++;
            }
            if(med+1<=j){
                med++;
                sum1 = (ll)a[med]*(med-i+1)-sum(i,med);
                sum2 = sum1+sum(med+1,j)-a[med]*(j-med);
                mn = min(mn, sum1+sum2), med--;
            }
        }
        if(mn<=k) l=mid;
        else r = mid-1;
    }
    return l;
}

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