Submission #336095

#	Time	Username	Problem	Language	Result	Execution time	Memory
336095		saarang123	Rice Hub (IOI11_ricehub)	C++14	100 / 100	24 ms	1516 KiB

ricehub

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

int besthub(int N, int L, int A[], long long B) {
    int answer = 0, low = 0, high = N;
    long long pref[N + 1];
    pref[0] = 0;
    for(int i = 1; i <= N; i++) pref[i] = pref[i - 1] + A[i - 1];
    while(low < high) {
        int mid = (low + high + 1) / 2;
        bool possible = false;
        for(int i = 0; i < N; i++) {
            int start = i, end = i + mid;
            if(end > N) break;
            int hub = (start + 1 + end) / 2;
            long long cost = abs((pref[hub] - pref[start]) - (long long) (hub - start) * A[hub - 1]);
            cost += abs((pref[end] - pref[hub]) - (long long) (end - hub) * A[hub - 1]);
            if(cost <= B) {
                possible = true;
                break;
            }
        }
        if(possible) {
            answer = max(answer, mid);
            low = mid;
        } else {
            high = mid - 1;
        }
    }
    return low;
}

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