#include "ricehub.h"
#include "bits/stdc++.h"
using namespace std;
const int maxn = 100005;
using ll = long long;
ll a[maxn], lim, p[maxn];
int n;
bool can(int x){
ll ret = LLONG_MAX;
for(int i = x; i <= n; ++i){
int l = i - x + 1;
ll mid = (l + (x / 2));
ll need = 0;
need += (a[mid] * (mid - l + 1)) - (p[mid] - p[l - 1]);
need += (p[i] - p[mid]) - (a[mid] * (i - mid));
ret = min(ret, need);
}
if(ret <= lim)return 1;
else return 0;
}
int besthub(int R, int L, int X[], long long B)
{
lim = B;
n = R;
for(int i = 1; i <= R; ++i){
a[i] = X[i - 1];
}
for(int i = 1; i <= R; ++i){
p[i] = p[i - 1] + a[i];
}
sort(a + 1, a + n + 1);
int lo = 1, hi = R, ans = 1;
while(lo <= hi){
int mid = (lo + hi) >> 1;
if(can(mid)){
ans = mid;
lo = mid + 1;
}else {
hi = mid - 1;
}
}
return ans;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
Output is correct |
| 2 |
Correct |
4 ms |
384 KB |
Output is correct |
| 3 |
Correct |
5 ms |
384 KB |
Output is correct |
| 4 |
Correct |
5 ms |
384 KB |
Output is correct |
| 5 |
Correct |
5 ms |
384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
384 KB |
Output is correct |
| 2 |
Correct |
4 ms |
384 KB |
Output is correct |
| 3 |
Correct |
4 ms |
384 KB |
Output is correct |
| 4 |
Correct |
5 ms |
384 KB |
Output is correct |
| 5 |
Correct |
5 ms |
384 KB |
Output is correct |
| 6 |
Correct |
4 ms |
384 KB |
Output is correct |
| 7 |
Correct |
4 ms |
384 KB |
Output is correct |
| 8 |
Correct |
4 ms |
384 KB |
Output is correct |
| 9 |
Correct |
5 ms |
384 KB |
Output is correct |
| 10 |
Correct |
5 ms |
384 KB |
Output is correct |
| 11 |
Correct |
5 ms |
384 KB |
Output is correct |
| 12 |
Correct |
5 ms |
384 KB |
Output is correct |
| 13 |
Correct |
5 ms |
384 KB |
Output is correct |
| 14 |
Correct |
4 ms |
384 KB |
Output is correct |
| 15 |
Correct |
4 ms |
384 KB |
Output is correct |
| 16 |
Correct |
5 ms |
384 KB |
Output is correct |
| 17 |
Correct |
5 ms |
384 KB |
Output is correct |
| 18 |
Correct |
5 ms |
384 KB |
Output is correct |
| 19 |
Correct |
4 ms |
384 KB |
Output is correct |
| 20 |
Correct |
5 ms |
384 KB |
Output is correct |
| 21 |
Correct |
5 ms |
384 KB |
Output is correct |
| 22 |
Correct |
5 ms |
384 KB |
Output is correct |
| 23 |
Correct |
5 ms |
512 KB |
Output is correct |
| 24 |
Correct |
5 ms |
384 KB |
Output is correct |
| 25 |
Correct |
5 ms |
384 KB |
Output is correct |
| 26 |
Correct |
4 ms |
384 KB |
Output is correct |
| 27 |
Correct |
5 ms |
384 KB |
Output is correct |
| 28 |
Correct |
5 ms |
384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
Output is correct |
| 2 |
Correct |
4 ms |
384 KB |
Output is correct |
| 3 |
Correct |
5 ms |
384 KB |
Output is correct |
| 4 |
Correct |
5 ms |
384 KB |
Output is correct |
| 5 |
Correct |
5 ms |
384 KB |
Output is correct |
| 6 |
Correct |
4 ms |
384 KB |
Output is correct |
| 7 |
Correct |
5 ms |
384 KB |
Output is correct |
| 8 |
Correct |
5 ms |
384 KB |
Output is correct |
| 9 |
Correct |
5 ms |
384 KB |
Output is correct |
| 10 |
Correct |
5 ms |
384 KB |
Output is correct |
| 11 |
Correct |
5 ms |
384 KB |
Output is correct |
| 12 |
Correct |
5 ms |
384 KB |
Output is correct |
| 13 |
Correct |
5 ms |
384 KB |
Output is correct |
| 14 |
Correct |
5 ms |
384 KB |
Output is correct |
| 15 |
Correct |
5 ms |
384 KB |
Output is correct |
| 16 |
Correct |
5 ms |
384 KB |
Output is correct |
| 17 |
Correct |
5 ms |
384 KB |
Output is correct |
| 18 |
Correct |
5 ms |
384 KB |
Output is correct |
| 19 |
Correct |
5 ms |
384 KB |
Output is correct |
| 20 |
Correct |
5 ms |
384 KB |
Output is correct |
| 21 |
Correct |
6 ms |
768 KB |
Output is correct |
| 22 |
Correct |
5 ms |
384 KB |
Output is correct |
| 23 |
Correct |
5 ms |
512 KB |
Output is correct |
| 24 |
Correct |
5 ms |
512 KB |
Output is correct |
| 25 |
Correct |
5 ms |
512 KB |
Output is correct |
| 26 |
Correct |
5 ms |
512 KB |
Output is correct |
| 27 |
Correct |
5 ms |
512 KB |
Output is correct |
| 28 |
Correct |
6 ms |
512 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
8 ms |
896 KB |
Output is correct |
| 2 |
Correct |
8 ms |
896 KB |
Output is correct |
| 3 |
Correct |
24 ms |
3328 KB |
Output is correct |
| 4 |
Correct |
24 ms |
3328 KB |
Output is correct |
| 5 |
Correct |
14 ms |
1664 KB |
Output is correct |
| 6 |
Correct |
14 ms |
1664 KB |
Output is correct |
| 7 |
Correct |
21 ms |
3072 KB |
Output is correct |
| 8 |
Correct |
22 ms |
3072 KB |
Output is correct |
| 9 |
Correct |
14 ms |
1536 KB |
Output is correct |
| 10 |
Correct |
15 ms |
1536 KB |
Output is correct |
| 11 |
Correct |
26 ms |
3328 KB |
Output is correct |
| 12 |
Correct |
26 ms |
3320 KB |
Output is correct |
| 13 |
Correct |
15 ms |
1664 KB |
Output is correct |
| 14 |
Correct |
15 ms |
1664 KB |
Output is correct |
| 15 |
Correct |
20 ms |
2560 KB |
Output is correct |
| 16 |
Correct |
20 ms |
2560 KB |
Output is correct |
| 17 |
Correct |
23 ms |
3072 KB |
Output is correct |
| 18 |
Correct |
24 ms |
3200 KB |
Output is correct |
| 19 |
Correct |
25 ms |
3200 KB |
Output is correct |
| 20 |
Correct |
25 ms |
3200 KB |
Output is correct |
