#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll pref[100010];
ll sum(int i, int j){ return pref[j+1]-pref[i]; }
int besthub(int n, int m, int a[], ll k)
{
pref[0] = 0;
for(int i = 0; i < n; i++)
pref[i+1] = pref[i]+(ll)a[i];
int l = 1, r = n;
while(l<r){
int mid = (l+r+1)/2; ll mn = (ll)4e18;
for(int i = 0; i <= n-mid; i++){
int j = i+mid-1; int med = (i+j)/2; int x = med;
ll sum1 = (ll)a[med]*(med-i+1)-sum(i,med);
ll sum2 = sum(med+1,j)-a[med]*(j-med);
mn = min(mn, sum1+sum2); int cnt = 20;
while(med-1>=i and cnt--){
med--;
sum1 = (ll)a[med]*(med-i+1)-sum(i,med);
sum2 = sum(med+1,j)-a[med]*(j-med);
mn = min(mn, sum1+sum2);
}
cnt = 20, med = x;
while(med+1<=j and cnt--){
med++;
sum1 = (ll)a[med]*(med-i+1)-sum(i,med);
sum2 = sum(med+1,j)-a[med]*(j-med);
mn = min(mn, sum1+sum2);
}
}
if(mn<=k) l=mid;
else r = mid-1;
}
return l;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
304 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
308 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
308 KB |
Output is correct |
| 7 |
Correct |
1 ms |
320 KB |
Output is correct |
| 8 |
Correct |
1 ms |
308 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
304 KB |
Output is correct |
| 11 |
Correct |
1 ms |
308 KB |
Output is correct |
| 12 |
Correct |
1 ms |
312 KB |
Output is correct |
| 13 |
Correct |
1 ms |
212 KB |
Output is correct |
| 14 |
Correct |
1 ms |
308 KB |
Output is correct |
| 15 |
Correct |
0 ms |
212 KB |
Output is correct |
| 16 |
Correct |
1 ms |
212 KB |
Output is correct |
| 17 |
Correct |
1 ms |
308 KB |
Output is correct |
| 18 |
Correct |
0 ms |
212 KB |
Output is correct |
| 19 |
Correct |
1 ms |
212 KB |
Output is correct |
| 20 |
Correct |
1 ms |
212 KB |
Output is correct |
| 21 |
Correct |
1 ms |
212 KB |
Output is correct |
| 22 |
Correct |
1 ms |
212 KB |
Output is correct |
| 23 |
Correct |
1 ms |
212 KB |
Output is correct |
| 24 |
Correct |
1 ms |
212 KB |
Output is correct |
| 25 |
Correct |
1 ms |
312 KB |
Output is correct |
| 26 |
Correct |
1 ms |
212 KB |
Output is correct |
| 27 |
Correct |
1 ms |
212 KB |
Output is correct |
| 28 |
Correct |
1 ms |
212 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
2 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 ms |
312 KB |
Output is correct |
| 10 |
Correct |
1 ms |
212 KB |
Output is correct |
| 11 |
Correct |
1 ms |
212 KB |
Output is correct |
| 12 |
Correct |
1 ms |
212 KB |
Output is correct |
| 13 |
Correct |
1 ms |
212 KB |
Output is correct |
| 14 |
Correct |
1 ms |
212 KB |
Output is correct |
| 15 |
Correct |
1 ms |
212 KB |
Output is correct |
| 16 |
Correct |
1 ms |
212 KB |
Output is correct |
| 17 |
Correct |
1 ms |
212 KB |
Output is correct |
| 18 |
Correct |
1 ms |
416 KB |
Output is correct |
| 19 |
Correct |
1 ms |
212 KB |
Output is correct |
| 20 |
Correct |
1 ms |
212 KB |
Output is correct |
| 21 |
Correct |
8 ms |
340 KB |
Output is correct |
| 22 |
Correct |
6 ms |
340 KB |
Output is correct |
| 23 |
Correct |
1 ms |
352 KB |
Output is correct |
| 24 |
Correct |
2 ms |
316 KB |
Output is correct |
| 25 |
Correct |
1 ms |
340 KB |
Output is correct |
| 26 |
Correct |
2 ms |
340 KB |
Output is correct |
| 27 |
Correct |
5 ms |
340 KB |
Output is correct |
| 28 |
Correct |
4 ms |
340 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
26 ms |
576 KB |
Output is correct |
| 2 |
Correct |
24 ms |
596 KB |
Output is correct |
| 3 |
Correct |
21 ms |
2496 KB |
Output is correct |
| 4 |
Incorrect |
54 ms |
2508 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
