| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 402514 |
2021-05-11T21:43:00 Z |
Lobo |
Rice Hub (IOI11_ricehub) |
C++17 |
|
24 ms |
3148 KB |
#include <bits/stdc++.h>
#include <ricehub.h>
using namespace std;
const long long INFll = 1e18;
const int INFii = 1e9;
const long long mod = (long long) 1e9 + 7;
typedef long long ll;
typedef int ii;
typedef double dbl;
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define maxn 110000
//LEMBRAR DE MUDAR
ll ps[maxn], x[maxn];
int besthub(int R, int L, int X[], long long B){
ps[0] = 0;
for(ll i = R; i >= 1; i--) {
x[i] = X[i-1];
}
for(ll i = 1; i <= R; i++) {
ps[i] = ps[i-1] + x[i];
}
ll ans = 0;
for(ll i = 1; i <= R; i++) {
ll l = i;
ll r = R;
ll mid = (l+r)/2;
ll best = i;
while(l <= r) {
ll m = (i+mid)/2;
ll cost = x[m]*(m-i+1) - ps[m] + ps[i-1] + ps[mid] - ps[m] - x[m]*(mid-m);
if(cost <= B) {
best = mid;
l = mid+1;
mid = (l+r)/2;
}
else {
r = mid-1;
mid = (l+r)/2;
}
}
ans = max(ans, best-i+1LL);
}
return ans;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 ms |
204 KB |
Output is correct |
| 3 |
Correct |
1 ms |
332 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
1 ms |
204 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 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 |
1 ms |
204 KB |
Output is correct |
| 10 |
Correct |
1 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 |
1 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 |
204 KB |
Output is correct |
| 22 |
Correct |
1 ms |
204 KB |
Output is correct |
| 23 |
Correct |
1 ms |
204 KB |
Output is correct |
| 24 |
Correct |
1 ms |
204 KB |
Output is correct |
| 25 |
Correct |
1 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 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 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 |
332 KB |
Output is correct |
| 8 |
Correct |
1 ms |
332 KB |
Output is correct |
| 9 |
Correct |
1 ms |
204 KB |
Output is correct |
| 10 |
Correct |
1 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 |
332 KB |
Output is correct |
| 14 |
Correct |
1 ms |
304 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 |
1 ms |
204 KB |
Output is correct |
| 19 |
Correct |
1 ms |
332 KB |
Output is correct |
| 20 |
Correct |
1 ms |
332 KB |
Output is correct |
| 21 |
Correct |
2 ms |
332 KB |
Output is correct |
| 22 |
Correct |
2 ms |
332 KB |
Output is correct |
| 23 |
Correct |
2 ms |
332 KB |
Output is correct |
| 24 |
Correct |
2 ms |
332 KB |
Output is correct |
| 25 |
Correct |
2 ms |
332 KB |
Output is correct |
| 26 |
Correct |
2 ms |
332 KB |
Output is correct |
| 27 |
Correct |
2 ms |
332 KB |
Output is correct |
| 28 |
Correct |
2 ms |
332 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
588 KB |
Output is correct |
| 2 |
Correct |
4 ms |
588 KB |
Output is correct |
| 3 |
Correct |
20 ms |
2176 KB |
Output is correct |
| 4 |
Correct |
24 ms |
2252 KB |
Output is correct |
| 5 |
Correct |
9 ms |
1228 KB |
Output is correct |
| 6 |
Correct |
9 ms |
1228 KB |
Output is correct |
| 7 |
Correct |
18 ms |
2188 KB |
Output is correct |
| 8 |
Correct |
17 ms |
2252 KB |
Output is correct |
| 9 |
Correct |
9 ms |
1228 KB |
Output is correct |
| 10 |
Correct |
9 ms |
1228 KB |
Output is correct |
| 11 |
Correct |
19 ms |
2252 KB |
Output is correct |
| 12 |
Correct |
19 ms |
2228 KB |
Output is correct |
| 13 |
Correct |
9 ms |
1228 KB |
Output is correct |
| 14 |
Correct |
9 ms |
1276 KB |
Output is correct |
| 15 |
Correct |
15 ms |
2476 KB |
Output is correct |
| 16 |
Correct |
16 ms |
2540 KB |
Output is correct |
| 17 |
Correct |
17 ms |
2052 KB |
Output is correct |
| 18 |
Correct |
18 ms |
2988 KB |
Output is correct |
| 19 |
Correct |
21 ms |
2840 KB |
Output is correct |
| 20 |
Correct |
18 ms |
3148 KB |
Output is correct |
