# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
581270 | stevancv | Rice Hub (IOI11_ricehub) | C++14 | 14 ms | 2516 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 <bits/stdc++.h>
#include "ricehub.h"
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int mxn = 1e5 + 2;
ll a[mxn];
ll n, k;
ll Get(ll l, ll r) {
if (l > r) return 0LL;
ll ans = a[r];
if (l > 0) ans -= a[l - 1];
return ans;
}
bool Can(ll x) {
for (ll i = 0; i <= n - x; i++) {
ll j = i + x - 1;
ll o = i + j >> 1;
ll val = Get(o, o);
ll tr = val * (o - i + 1) - Get(i, o);
tr += Get(o + 1, j) - val * (j - o);
if (tr <= k) return true;
}
return false;
}
int besthub(int N, int M, int A[], ll K) {
n = N; k = K;
for (ll i = 0; i < n; i++) {
a[i] = A[i];
if (i > 0) a[i] += a[i - 1];
}
ll l = 1; ll r = n;
int ans = l;
while (l <= r) {
ll mid = l + r >> 1;
if (Can(mid)) {
l = mid + 1;
ans = mid;
}
else r = mid - 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... |