# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
55850 | leejseo | Rice Hub (IOI11_ricehub) | C++98 | 32 ms | 1792 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 <algorithm>
using namespace std;
long long S[1000001];
inline long long val(int i){
return i<0? 0 : S[i];
}
inline long long cost(int i, int j, int X[]){
int mid = i+j >> 1;
long long left = (long long) X[mid] * (mid - i) - (val(mid-1) - val(i-1));
long long right = val(j) - val(mid) - (long long) X[mid] * (j - mid);
return left + right;
}
int besthub(int R, int L, int X[], long long B){
S[0] = X[0];
for (int i=1; i<R; i++) S[i] = S[i-1] + X[i];
int ans = 0;
int i=0, j=0;
while (i < R && j < R){
if (cost(i, j, X) > B){
i++;
continue;
}
ans = max(ans, j-i+1);
j++;
}
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... |