| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 684162 | sudheerays123 | Rice Hub (IOI11_ricehub) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "ricehub.h"
#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll int
const ll N = 100+5 , INF = 1e18 , MOD = 1e9+7;
ll besthub(ll R, ll L, ll X[], ll B){
ll low = 1 , high = R;
ll ans;
function<bool(ll)> check = [&](ll l){
for(ll i = 1; i <= R-l+1; i++){
ll j = i+l-1;
ll mid = (i+j)/2;
ll cost = 0;
for(ll k = i; k <= j; k++) cost += abs(X[k]-X[mid]);
if(cost <= B) return true;
}
return false;
};
while(low <= high){
ll mid = (low+high)/2;
if(check(mid)){
ans = mid;
low = mid+1;
}
else high = mid-1;
}
return ans;
}