| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 888953 |
2023-12-18T13:06:15 Z |
dwuy |
Rice Hub (IOI11_ricehub) |
C++14 |
|
11 ms |
5724 KB |
/// dwuy: _,\,,,_\,__,\,,_
#include <bits/stdc++.h>
#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL)
#define file(a) freopen(a".inp","r",stdin); freopen(a".out", "w",stdout)
#define fi first
#define se second
#define endl "\n"
#define len(s) int32_t(s.length())
#define MASK(k)(1LL<<(k))
#define TASK ""
using namespace std;
typedef tuple<int, int, int> tpiii;
typedef pair<double, double> pdd;
typedef pair<int, int> pii;
typedef long long ll;
const long long OO = 1e18;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const int MX = 200005;
ll n, l, money;
ll a[MX];
ll sum[MX];
ll get(ll l, ll r){
return sum[r] - sum[l-1];
}
ll cost(ll l, ll r){
ll mid = (l+r)>>1;
return get(mid+1, r) - get(l, mid - ((r-l+1)&1));
}
ll besthub(int N, int L, int X[], ll B){
n = N;
l = L;
money = B;
for(ll i=1; i<=n; i++){
a[i] = X[i-1];
sum[i] = sum[i-1] + a[i];
}
ll ans = 0;
for(ll l=1, r=1; r<=n; r++){
while(cost(l, r)>money) l++;
ans = max(ans, r-l+1);
}
return ans;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 2 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 3 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 4 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 5 |
Correct |
1 ms |
4444 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4440 KB |
Output is correct |
| 2 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 3 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 4 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 5 |
Correct |
1 ms |
4440 KB |
Output is correct |
| 6 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 7 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 8 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 9 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 10 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 11 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 12 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 13 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 14 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 15 |
Correct |
1 ms |
4440 KB |
Output is correct |
| 16 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 17 |
Correct |
1 ms |
4548 KB |
Output is correct |
| 18 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 19 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 20 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 21 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 22 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 23 |
Correct |
1 ms |
4440 KB |
Output is correct |
| 24 |
Correct |
1 ms |
4440 KB |
Output is correct |
| 25 |
Correct |
1 ms |
4448 KB |
Output is correct |
| 26 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 27 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 28 |
Correct |
1 ms |
4444 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 2 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 3 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 4 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 5 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 6 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 7 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 8 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 9 |
Correct |
1 ms |
4696 KB |
Output is correct |
| 10 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 11 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 12 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 13 |
Correct |
1 ms |
4440 KB |
Output is correct |
| 14 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 15 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 16 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 17 |
Correct |
1 ms |
4440 KB |
Output is correct |
| 18 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 19 |
Correct |
1 ms |
4440 KB |
Output is correct |
| 20 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 21 |
Correct |
1 ms |
4440 KB |
Output is correct |
| 22 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 23 |
Correct |
1 ms |
4548 KB |
Output is correct |
| 24 |
Correct |
1 ms |
4544 KB |
Output is correct |
| 25 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 26 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 27 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 28 |
Correct |
1 ms |
4700 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
4700 KB |
Output is correct |
| 2 |
Correct |
2 ms |
4700 KB |
Output is correct |
| 3 |
Correct |
9 ms |
5672 KB |
Output is correct |
| 4 |
Correct |
10 ms |
5672 KB |
Output is correct |
| 5 |
Correct |
5 ms |
4956 KB |
Output is correct |
| 6 |
Correct |
5 ms |
4956 KB |
Output is correct |
| 7 |
Correct |
10 ms |
5312 KB |
Output is correct |
| 8 |
Correct |
8 ms |
5308 KB |
Output is correct |
| 9 |
Correct |
5 ms |
4956 KB |
Output is correct |
| 10 |
Correct |
4 ms |
4804 KB |
Output is correct |
| 11 |
Correct |
11 ms |
5548 KB |
Output is correct |
| 12 |
Correct |
10 ms |
5724 KB |
Output is correct |
| 13 |
Correct |
5 ms |
4908 KB |
Output is correct |
| 14 |
Correct |
5 ms |
4952 KB |
Output is correct |
| 15 |
Correct |
7 ms |
5468 KB |
Output is correct |
| 16 |
Correct |
7 ms |
5424 KB |
Output is correct |
| 17 |
Correct |
9 ms |
5592 KB |
Output is correct |
| 18 |
Correct |
9 ms |
5468 KB |
Output is correct |
| 19 |
Correct |
9 ms |
5724 KB |
Output is correct |
| 20 |
Correct |
11 ms |
5544 KB |
Output is correct |
