Submission #1027806

#	Time	Username	Problem	Language	Result	Execution time	Memory
1027806		vjudge1	쌀 창고 (IOI11_ricehub)	C++17	17 / 100	1069 ms	1884 KiB

ricehub

#include <bits/stdc++.h>
using namespace std;
int besthub(int n, int L, int x[], long long b)
{
    int l=0, r=n-1;
    while(r-l>1)
    {
        int mid=(r+l)/2;
        long long min_dist=LLONG_MAX;
        for(int i=0; i<=n-mid-1; i++)
        {
            int polovina=(i+i+mid)/2, kraj=i+mid;
            long long dist=0;
            for(int j=i; j<polovina; j++)
            {
                dist+=abs(x[j]-x[polovina]);
            }
            for(int j=polovina+1; j<=kraj; j++)
            {
                dist+=abs(x[j]-x[polovina]);
            }
            min_dist=min(dist, min_dist);
        }
        if(min_dist<=b)
        {
            l=mid;
        }
        else
        {
            r=mid;
        }
    }
    return r;
}

/*int main()
{
    int r, l;
    long long b;
    cin>>r>>l;
    int x[r];
    for(int i=0; i<r; i++)
        cin>>x[i];
    cin>>b;
    cout<<besthub(r, l, x, b);

    return 0;
}*/

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