# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
418274 | Maqsut_03 | Rice Hub (IOI11_ricehub) | C++14 | 1089 ms | 644 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>
#define ll long long
using namespace std;
const int M = 1e9 + 7;
int besthub(int R, int L, int X[], long long B)
{
ll ans = 0, m;
for (int i=0; i<R; i++)
{
ll sum = 1, b = B, j = i;
ll l = i - 1, r = i + 1;
while (1)
{
if (r < R && l >= 0 && X[i] - X[l] <= X[r] - X[i]) m = X[i] - X[l], l--;
else if (r < R) m = X[r] - X[i], r++;
else break;
if (m > b) break;
else sum++, b -= m;
}
ans = max(ans, sum);
}
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... |