#include "bits/stdc++.h"
#include "ricehub.h"
#define i64 long long
using namespace std;
const int sz = 2e5 + 10;
int a[sz];
int n;
i64 b;
bool che(int x) {
int ra = x / 2;
int ps = ra;
i64 sm = 0;
for (int i = 0; i < x; i ++) {
sm += abs(a[i] - a[ps]);
}
if (sm <= b) {
return true;
}
ps ++;
for (; ps < n - ra; ps ++) {
int pps = ps - 1; // previous ps
sm -= abs(a[pps - ra] - a[pps]); // delete leftmost
sm -= abs(a[pps] - a[ps]); // delete new ps
sm -= (ra - 1); // distance to right decreases
sm += abs(a[pps] - a[ps]); // add previous ps
sm += (ra - 1); // distance to left increases
sm += abs(a[ps + ra] - a[ps]); // add rightmost
if (sm <= b) {
return true;
}
}
return false;
}
int besthub(int R, int L, int X[], long long B)
{
int le, ri;
le = 0, ri = R;
for (int i = 0; i < R; i ++) {
a[i] = X[i];
}
b = B;
n = R;
while (1 < ri - le) {
int mi = le + (ri - le) / 2;
if (che(mi)) {
le = mi;
} else {
ri = mi;
}
}
return le;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
444 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
740 KB |
Output is correct |
2 |
Correct |
2 ms |
604 KB |
Output is correct |
3 |
Incorrect |
9 ms |
2192 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |