Submission #1138149

#	Time	Username	Problem	Language	Result	Execution time	Memory
1138149		MattNattFeczan	Rice Hub (IOI11_ricehub)	C++20	42 / 100	1093 ms	428 KiB

ricehub

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

int besthub(int R, int L, int X[], long long B) {
    int max_fields = 0;

    // Iterate over all possible hub positions (1 to L)
    for (int hub = 1; hub <= L; ++hub) {
        // Calculate the cost of transporting rice for each subset of rice fields
        for (int start = 0; start < R; ++start) {
            long long cost = 0;
            int count = 0;

            for (int end = start; end < R; ++end) {
                cost += abs(X[end] - hub);
                if (cost > B) {
                    break;
                }

                count++;
                max_fields = max(max_fields, count);
            }
        }
    }

    return max_fields;
}

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