Submission #497302

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
497302	2021-12-23 02:01:28	Cr45hor	Rice Hub (IOI11_ricehub)	C++14	100 / 100	19 ms	3280 KiB

ricehub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool check(int dis, int n, vector < ll > &pre, vector < ll > &x, ll B) {
    ll ans = 1e16;
    for (int l = 1; l + dis - 1 <= n; l++) {
        int r = l + dis - 1;
        int med = (l + r) >> 1; // x[l] -> x[r] => x[l] -> x[med] and x[med] -> x[r]
        ll mb = x[med] * (med - l + 1) - (pre[med] - pre[l - 1]) + (pre[r] - pre[med - 1]) - x[med] * (r - med + 1);
        ans = min(ans, mb);
    }
    return ans <= B;
}
int besthub(int R, int L, int X[], ll B) {
    int n = R;
    vector < ll > pre(n + 1), x(n + 1);
    pre[0] = 0;
    for (int i = 1; i <= n; i++) {
        x[i] = 1LL * X[i - 1];
        pre[i] = pre[i - 1] + x[i];
    }
    int l = 1, r = n;
    while(r - l > 1) {
        int mid = (l + r) >> 1;
        if (check(mid, n, pre, x, B))
            l = mid;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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