Submission #486000

#	Time	Username	Problem	Language	Result	Execution time	Memory
486000		Jomnoi	Rice Hub (IOI11_ricehub)	C++17	43 / 100	1089 ms	1724 KiB

ricehub

#include <bits/stdc++.h>
#include <ricehub.h>
#define DEBUG 0
using namespace std;

int cost(int R, int X[], int pos, long long B) {
    vector <int> truckload;
    for(int i = 0; i < R; i++) {
        truckload.push_back(abs(X[i] - pos));
    }
    sort(truckload.begin(), truckload.end());
    long long sum = 0;
    for(int i = 0; i < R; i++) {
        if(sum + truckload[i] > B) {
            return i;
        }
        sum += truckload[i];
    }
    return R;
}

int besthub(int R, int L, int X[], long long B) {
    int l = 0, r = L, ans = 0;
    while(l <= r) {
        int mid = (l + r) / 2;
        int cost1 = cost(R, X, mid, B);
        int l2 = l + 1, r2 = r, pos2 = r;
        while(l2 <= r2) {
            int mid2 = (l2 + r2) / 2;
            int cost2 = cost(R, X, mid2, B);
            if(cost1 == cost2) {
                l2 = mid2 + 1;
            }
            else {
                r2 = mid2 - 1;
                pos2 = min(pos2, mid2);
            }
        }
        int cost2 = cost(R, X, pos2, B);
        if(cost1 > cost2) {
            r = mid - 1;
            ans = max(ans, cost1);
        }
        else {
            l = mid + 1;
            ans = max(ans, cost2);
        }
    }
    return ans;
}

// int main() {
//     ios_base::sync_with_stdio(0);
//     cin.tie(0);
//     int r, l, b;
//     cin >> r >> l >> b;
//     int x[l];
//     for(int i = 0; i < r; i++) {
//         cin >> x[i];
//     }
//     cout << besthub(r, l, x, b);
//     return 0;
// }

/*
5 20 6
1 2 10 12 14
*/

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