제출 #1267291

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1267291		BlockOG	Rice Hub (IOI11_ricehub)	C++20	0 / 100	0 ms	324 KiB

ricehub

#include <bits/stdc++.h>

// mrrrow meeow :3
// go play vivid/stasis now! it's free on steam

#define fo(i, a, b) for (auto i = (a); i < (b); i++)
#define of(i, a, b) for (auto i = (b); i-- > (a);)
#define f first
#define s second
#define pb push_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound
#define be(a) a.begin(), a.end()
using namespace std;

int ____init = [] {
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    return 0;
}();

int besthub(int r, int l, int x[], long long b) {

    int res = 0;

    int curr;

    {
        curr = x[r / 2];
        int last = 0;
        int diff = 0;
        int used = 0;
        long long sum = 0;
        fo(i, 0, r) {
            sum += abs(x[i] - curr);
            used++;

            while (last <= i && sum > b) {
                sum -= abs(x[last++] - curr);
                used--;
            }

            res = max(res, used);
        }
    }

    {
        curr = x[(r + 1) / 2];
        int last = 0;
        int diff = 0;
        int used = 0;
        long long sum = 0;
        fo(i, 0, r) {
            sum += abs(x[i] - curr);
            used++;

            while (last <= i && sum > b) {
                sum -= abs(x[last++] - curr);
                used--;
            }

            res = max(res, used);
        }
    }

    return res;
}

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