#include "bits/stdc++.h"
#include "ricehub.h"
#define i64 long long
using namespace std;
const i64 sz = 2e5 + 10;
i64 a[sz];
i64 n;
i64 b;
bool che(i64 x) {
i64 ra = x / 2 - !(x % 2);
i64 ps = ra;
i64 sm = 0;
for (i64 i = 0; i < x; i ++) {
sm += abs(a[i] - a[ps]);
}
if (sm <= b) {
return true;
}
ps ++;
for (; ps < n - ra; ps ++) {
i64 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)
{
i64 le, ri;
le = 0, ri = R + 1;
for (i64 i = 0; i < R; i ++) {
a[i] = X[i];
}
b = B;
n = R;
while (1 < ri - le) {
i64 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 |
348 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 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
448 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
348 KB |
Output is correct |
| 12 |
Correct |
0 ms |
348 KB |
Output is correct |
| 13 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 14 |
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 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
348 KB |
Output is correct |
| 12 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 13 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
604 KB |
Output is correct |
| 2 |
Correct |
2 ms |
604 KB |
Output is correct |
| 3 |
Correct |
12 ms |
2652 KB |
Output is correct |
| 4 |
Correct |
10 ms |
2680 KB |
Output is correct |
| 5 |
Correct |
5 ms |
1624 KB |
Output is correct |
| 6 |
Correct |
4 ms |
1372 KB |
Output is correct |
| 7 |
Correct |
9 ms |
2356 KB |
Output is correct |
| 8 |
Correct |
8 ms |
2140 KB |
Output is correct |
| 9 |
Correct |
4 ms |
1116 KB |
Output is correct |
| 10 |
Correct |
4 ms |
1116 KB |
Output is correct |
| 11 |
Correct |
9 ms |
2604 KB |
Output is correct |
| 12 |
Correct |
9 ms |
2648 KB |
Output is correct |
| 13 |
Correct |
4 ms |
1280 KB |
Output is correct |
| 14 |
Correct |
4 ms |
1224 KB |
Output is correct |
| 15 |
Correct |
7 ms |
1884 KB |
Output is correct |
| 16 |
Correct |
8 ms |
1884 KB |
Output is correct |
| 17 |
Correct |
8 ms |
2392 KB |
Output is correct |
| 18 |
Correct |
8 ms |
2392 KB |
Output is correct |
| 19 |
Correct |
9 ms |
2428 KB |
Output is correct |
| 20 |
Correct |
9 ms |
2396 KB |
Output is correct |
