# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
28766 | h0ngjun7 | Rice Hub (IOI11_ricehub) | C++14 | 23 ms | 5020 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"
int besthub(int R, int L, int X[], long long B)
{
int l = 0, r = R, ans = 0;
while (l <= r) {
int m = (l + r) / 2;
long long dist = 0;
int left, right, mid, ok = 0;
int ln = 0, rn = 0;
for (int i = 0; i < R && !ok; i++) {
if (i + 1 == m) {
left = (i + 1) - m, right = i;
mid = (left + right) / 2;
for (int j = left; j < mid; j++) dist += X[mid] - X[j], ln++;
for (int j = mid + 1; j <= right; j++) dist += X[j] - X[mid], rn++;
if (dist <= B) ok = 1;
}
else if (i + 1 > m) {
dist -= X[mid] - X[left]; left++;
dist += 1LL * (X[mid + 1] - X[mid]) * (ln - rn); mid++;
dist += X[right + 1] - X[mid]; right++;
if (dist <= B) ok = 1;
}
}
if (ok) {
if (ans < m) ans = m;
l = m + 1;
}
else r = m - 1;
}
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... |