# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
551235 | alireza_kaviani | Rice Hub (IOI11_ricehub) | C++17 | 31 ms | 2612 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;
typedef long long ll;
const ll MAXN = 1e5 + 10;
ll n , k , A[MAXN] , ps[MAXN];
int check(ll x){
ll l = x / 2 , r = x - l - 1;
for(int i = 1 ; i + x <= n + 1 ; i++){
ll cost = ps[i + x - 1] - ps[i + l] - ps[i + l - 1] + ps[i - 1] + A[i + l] * (l - r);
if(cost <= k) return 1;
}
return 0;
}
int besthub(int R, int L, int X[], long long B){
n = R; k = B;
for(int i = 1 ; i <= n ; i++){
A[i] = X[i - 1];
ps[i] = A[i] + ps[i - 1];
}
ll l = 1 , r = n + 1;
while(r - l > 1){
int mid = l + r >> 1;
if(check(mid)) l = mid;
else r = mid;
}
return l;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |