#include "ricehub.h"
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
ll get_sum(int l, int r, vector<ll> &sum){
return (l==0) ? sum[r] : sum[r]-sum[l-1];
}
bool check(int l, int r, ll b, int v[], vector<ll> &sum){
int med=(l+r)/2;
ll act=(long long) v[med]*(med-l+1LL)-get_sum(l,med,sum);
act+=(long long) get_sum(med,r,sum)-v[med]*(r-med+1LL);
return act<=b;
}
int besthub(int n, int dist, int v[], ll b){
vector<ll> sum(n);
sum[0]=v[0];
for(int i=1;i<n;i++)
sum[i]=sum[i-1]+v[i];
int res=0;
for(int i=0;i<n;i++){
int l=i,r=n-1,act=0;
while(l<=r){
int med=(l+r)/2;
if(check(i,med,b,v,sum)){
act=med;
l=med+1;
}
else r=med-1;
}
res=max(res,act-i+1);
}
return res;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
0 ms |
204 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
0 ms |
204 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| 7 |
Correct |
0 ms |
204 KB |
Output is correct |
| 8 |
Correct |
0 ms |
204 KB |
Output is correct |
| 9 |
Correct |
0 ms |
204 KB |
Output is correct |
| 10 |
Correct |
0 ms |
204 KB |
Output is correct |
| 11 |
Correct |
0 ms |
204 KB |
Output is correct |
| 12 |
Correct |
0 ms |
204 KB |
Output is correct |
| 13 |
Correct |
1 ms |
204 KB |
Output is correct |
| 14 |
Correct |
1 ms |
204 KB |
Output is correct |
| 15 |
Correct |
1 ms |
204 KB |
Output is correct |
| 16 |
Correct |
1 ms |
204 KB |
Output is correct |
| 17 |
Correct |
0 ms |
204 KB |
Output is correct |
| 18 |
Correct |
0 ms |
204 KB |
Output is correct |
| 19 |
Correct |
0 ms |
204 KB |
Output is correct |
| 20 |
Correct |
0 ms |
204 KB |
Output is correct |
| 21 |
Correct |
0 ms |
204 KB |
Output is correct |
| 22 |
Correct |
0 ms |
204 KB |
Output is correct |
| 23 |
Correct |
0 ms |
280 KB |
Output is correct |
| 24 |
Correct |
0 ms |
204 KB |
Output is correct |
| 25 |
Correct |
0 ms |
204 KB |
Output is correct |
| 26 |
Correct |
1 ms |
204 KB |
Output is correct |
| 27 |
Correct |
1 ms |
204 KB |
Output is correct |
| 28 |
Correct |
1 ms |
204 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
1 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
1 ms |
204 KB |
Output is correct |
| 6 |
Correct |
1 ms |
204 KB |
Output is correct |
| 7 |
Correct |
1 ms |
204 KB |
Output is correct |
| 8 |
Correct |
1 ms |
204 KB |
Output is correct |
| 9 |
Correct |
0 ms |
204 KB |
Output is correct |
| 10 |
Correct |
0 ms |
204 KB |
Output is correct |
| 11 |
Correct |
1 ms |
204 KB |
Output is correct |
| 12 |
Correct |
1 ms |
204 KB |
Output is correct |
| 13 |
Correct |
1 ms |
204 KB |
Output is correct |
| 14 |
Correct |
1 ms |
204 KB |
Output is correct |
| 15 |
Correct |
1 ms |
204 KB |
Output is correct |
| 16 |
Correct |
1 ms |
204 KB |
Output is correct |
| 17 |
Correct |
1 ms |
204 KB |
Output is correct |
| 18 |
Correct |
0 ms |
204 KB |
Output is correct |
| 19 |
Correct |
1 ms |
204 KB |
Output is correct |
| 20 |
Correct |
1 ms |
204 KB |
Output is correct |
| 21 |
Correct |
1 ms |
332 KB |
Output is correct |
| 22 |
Correct |
1 ms |
332 KB |
Output is correct |
| 23 |
Correct |
1 ms |
332 KB |
Output is correct |
| 24 |
Correct |
1 ms |
332 KB |
Output is correct |
| 25 |
Correct |
1 ms |
332 KB |
Output is correct |
| 26 |
Correct |
1 ms |
332 KB |
Output is correct |
| 27 |
Correct |
2 ms |
332 KB |
Output is correct |
| 28 |
Correct |
2 ms |
332 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
460 KB |
Output is correct |
| 2 |
Correct |
4 ms |
460 KB |
Output is correct |
| 3 |
Correct |
26 ms |
1484 KB |
Output is correct |
| 4 |
Correct |
20 ms |
1416 KB |
Output is correct |
| 5 |
Correct |
9 ms |
1228 KB |
Output is correct |
| 6 |
Correct |
9 ms |
1228 KB |
Output is correct |
| 7 |
Correct |
19 ms |
2204 KB |
Output is correct |
| 8 |
Correct |
19 ms |
2256 KB |
Output is correct |
| 9 |
Correct |
10 ms |
1100 KB |
Output is correct |
| 10 |
Correct |
10 ms |
1100 KB |
Output is correct |
| 11 |
Correct |
22 ms |
2488 KB |
Output is correct |
| 12 |
Correct |
21 ms |
2508 KB |
Output is correct |
| 13 |
Correct |
10 ms |
1228 KB |
Output is correct |
| 14 |
Correct |
10 ms |
1228 KB |
Output is correct |
| 15 |
Correct |
20 ms |
1868 KB |
Output is correct |
| 16 |
Correct |
15 ms |
1928 KB |
Output is correct |
| 17 |
Correct |
21 ms |
2236 KB |
Output is correct |
| 18 |
Correct |
22 ms |
2200 KB |
Output is correct |
| 19 |
Correct |
20 ms |
2360 KB |
Output is correct |
| 20 |
Correct |
20 ms |
2416 KB |
Output is correct |
