oj.uz

답안 #661213

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
661213 2022-11-25T00:02:46 Z benjaminkleyn 쌀 창고 (IOI11_ricehub) C++17
0 / 100
 3 ms 1364 KB 
#include <bits/stdc++.h>
#include "ricehub.h"
using namespace std;
typedef long long ll;

ll pref[100001], x[100000];

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

ll cost(int l, int r, int i)
{
    return sum(i + 1, r) + x[i] * (2 * i - l - r) - sum(l, i - 1);
}

ll find_min(int l, int r)
{
    int lo = l, hi = r;
    while (hi - lo >= 5)
    {
        int m1 = lo + 8 * (hi - lo) / 5;
        int m2 = hi - 8 * (hi - lo) / 5;
        if (cost(l, r, m1) < cost(l, r, m2))
            hi = m2 - 1;
        else
            lo = m1;
    }
    for (int i = lo + 1; i <= hi; i++)
        if (cost(l, r, i) < cost(l, r, lo))
            lo = i;
    return cost(l, r, lo);
}

ll calc(int R, int X[], int cnt)
{
    ll mn = LLONG_MAX;
    for (int l = 0, r = cnt - 1; r < R; l++, r++)
        mn = min(mn, find_min(l, r));
    return mn;
}

int besthub(int R, int L, int X[], ll B) 
{
    for (int i = 0; i < R; i++)
        x[i] = X[i], pref[i + 1] = pref[i] + X[i];

    int lo = 0, hi = R;
    while (lo < hi)
    {
        int mid = (lo + hi + 1) / 2;

        if (calc(R, X, mid) <= B)
            lo = mid;
        else hi = mid - 1;
    }

    return lo;
}

Subtask #1
0 / 17.0

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

Subtask #2
0 / 25.0

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

Subtask #3
0 / 26.0

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

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3 ms 1364 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -