oj.uz

답안 #1027906

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1027906 2024-07-19T11:23:09 Z vjudge1 쌀 창고 (IOI11_ricehub) C++17
17 / 100
 9 ms 2088 KB 
#include <bits/stdc++.h>
using namespace std;
int besthub(int n, int L, int x[], long long b)
{
    int l=0, r=n-1;
    int prefix_sum[n+1];
    prefix_sum[0]=0;
    for(int i=1; i<=n; i++)
    {
        prefix_sum[i]=x[i-1]+prefix_sum[i-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]);
            }*/
                    //levo
            dist+=(polovina-i)*x[polovina]-(prefix_sum[polovina]-prefix_sum[i]);
            //dist+=prefix_sum[polovina]-(prefix_sum[i-1]-(polovina-i)*x[polovina]);
                    //desno
            dist+=(prefix_sum[kraj+1]-prefix_sum[polovina+1])-(kraj-polovina)*x[polovina];
            //dist+=(kraj-polovina)*x[polovina]+prefix_sum[kraj+1]-prefix_sum[polovina+1];
            /*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+1;
        }
        else
        {
            r=mid;
        }
    }
    return l;
}

/*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.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Incorrect 9 ms 2088 KB Output isn't correct
4 Halted 0 ms 0 KB -