# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
556301 | Dan4Life | Rice Hub (IOI11_ricehub) | C++17 | 14 ms | 1424 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 ll long long
ll pref[100010];
ll sum(int i, int j){ return pref[j+1]-pref[i]; }
int besthub(int n, int m, int a[], ll k)
{
/*
for(int i = 0; i < n; i++){
int j = i;
while(i<n and a[i]==a[i+1]) i++;
v.pb({a[j],j-i+1});
}
n = (int)v.size();*/
pref[0] = 0;
for(int i = 0; i < n; i++)
pref[i+1] = pref[i]+(ll)a[i];//v[i].second;
int l = 1, r = n;
while(l<r){
int mid = (l+r+1)/2; ll mn = (ll)4e18;
for(int i = 0; i <= n-mid; i++){
int j = i+mid-1; int med = (i+j)/2; int x = med;
ll sum1 = (ll)a[med]*(med-i+1)-sum(i,med);
ll sum2 = sum(med+1,j)-a[med]*(j-med);
mn = min(mn, sum1+sum2);
}
if(mn<=k) l=mid;
else r = mid-1;
}
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... |