Submission #235546

#	Time	Username	Problem	Language	Result	Execution time	Memory
235546		Toirov_Sadi	Rice Hub (IOI11_ricehub)	C++17	68 / 100	1088 ms	1792 KiB

ricehub

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

using namespace std;

int besthub(int n, int L, int X[], long long B){
    int res = 0;
    for(int i = 0; i < n; i ++){
        int l = i, r = i;
        long long ans = 0;
        while(l >= 0 && r < n){
            int x = INT_MAX;
            int y = INT_MAX;
            if(l > 0) x = X[i] - X[l - 1];
            if(r < n - 1) y = X[r + 1] - X[i];

            if(x < y && ans + x <= B) l --, ans += x;
            else if(y < x && ans + y <= B) r ++, ans += y;
            else if(x == y && x != INT_MAX && ans + x <= B) l --, ans += x;
            else break;
        }
        res = max(res, r - l + 1);
    }
    return res;
}

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