oj.uz

Submission #753283

# Submission time Handle Problem Language Result Execution time Memory
753283 2023-06-05T02:29:21 Z acceptify Rice Hub (IOI11_ricehub) C++17
0 / 100
 3 ms 468 KB 
#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;

int besthub(int R, int L, int X[], long long B){
    long long ps[R];
    for (int i = 0; i < R; i++) ps[i] = X[i] + (i ? ps[i - 1] : 0);
    auto calc = [&] (int l, int r, int p) -> long long {
        long long sum = 0;
        sum += X[p] * (p - l + 1) - ps[p] - (l ? ps[l - 1] : 0);
        sum += ps[r] - ps[p] - X[p] * (r - p);
        return sum;
    };
    int l = 0, r = R, res = 0;
    while (l <= r) {
        int mid = (l + r) / 2;
        long long cost = 1e18;
        for (int i = 0; i + mid - 1 < R; i++) {
            int p = (i + i + mid - 1) / 2;
            cost = min({cost, calc(i, i + mid - 1, p), calc(i, i + mid - 1, p + 1)});
        }
        if (cost <= B) l = mid + 1, res = mid;
        else r = mid - 1;
    }
    return res;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 468 KB Output isn't correct
2 Halted 0 ms 0 KB -