# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
133032 | Boxworld | Rice Hub (IOI11_ricehub) | C++14 | 21 ms | 2424 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;
const int maxN=100100;
long long S[maxN],x[maxN];
int besthub(int R, int L, int X[], long long B){
S[0]=0;x[0]=0;
for (int i=1;i<=R;i++){
x[i]=X[i-1];
S[i]=S[i-1]+X[i-1];
}
int l,r,ans=1;
for (int l=1;l<=R;l++)
for (int r=l+ans;r<=R;r++){
int m=(l+r)/2;
long long cost=(m-l)*x[m]-(S[m-1]-S[l-1])+S[r]-S[m]-(r-m)*x[m];
if(cost<=B)ans=max(ans,r-l+1);
else break;
}
return ans;
}
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... |