# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
65309 | zubec | Rice Hub (IOI11_ricehub) | C++14 | 31 ms | 16936 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 <bits/stdc++.h>
using namespace std;
long long a[100100], pref[100100], n, L;
bool f(int x){
for (int i = x; i <= n; i++){
int l = i-x+1;
int r = i;
int mid = (l+r)>>1;
long long sum = (pref[r]-pref[mid])-a[mid]*1ll*(r-mid);
sum += a[mid]*1ll*(mid-l)-(pref[mid-1]-pref[l-1]);
if (sum <= L)
return 1;
}
return 0;
}
int besthub(int n, int L, int X[], long long B){
::n = n;
for (int i = 0; i < n; i++)
a[i+1] = X[i];
for (int i = 1; i <= n; i++){
pref[i] = pref[i-1] + a[i];
}
::L = B;
int l = 1, r = n;
while(l < r){
# | 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... |