Submission #1236280

#	Time	Username	Problem	Language	Result	Execution time	Memory
1236280		mathias_abadie	Rice Hub (IOI11_ricehub)	C++20	42 / 100	1095 ms	328 KiB

ricehub

#include <bits/stdc++.h>
#include "ricehub.h"

using namespace std;

int besthub(int R, int L, int X[], long long B) {
    int maxRice = 0;
    for (int hub = 1; hub <= L; ++hub) {
        vector<long long> costs;
        for (int i = 0; i < R; ++i) {
            costs.push_back(abs((long long)X[i] - hub));
        }
        sort(costs.begin(), costs.end());
        long long totalCost = 0;
        int count = 0;
        for (int i = 0; i < R; ++i) {
            totalCost += costs[i];
            if (totalCost <= B) {
                count++;
            } else {
                break;
            }
        }

        maxRice = max(maxRice, count);
    }

    return maxRice;
}

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