제출 #1217384

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1217384		countless	쌀 창고 (IOI11_ricehub)	C++20	42 / 100	1095 ms	552 KiB

ricehub

#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;

#define sp <<" "<<
#define endl "\n"

int besthub(int R, int L, int X[], ll B) {
    int best = 0;

    auto process = [&](int x) -> int {
        int res = 0;
        ll have = B;
        priority_queue<ll, vector<ll>, greater<ll>> st;
        for (int i = 0; i < R; i++) {
            st.push(abs(X[i] - x));
        }

        while (!st.empty()) {
            int take = st.top(); st.pop();
            if (take > have) break;

            res++;
            have -= take;
        }

        return res;
    };

    // try placing
    for (int i = 0; i < R; i++) {
        best = max(best, process(X[i]));
    }

    return best;
}

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