| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1003129 |
2024-06-20T06:31:35 Z |
vjudge1 |
Rice Hub (IOI11_ricehub) |
C++17 |
|
1000 ms |
1880 KB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define pf push_front
#define pb push_back
#define pi pair<int,int>
#define vi vector<int>
/*
int besthub(int n, int last, int x[], ll b){
int ans = 0;
int l , r;
for(int i = 0; i < n; i++){
l = i - (lower_bound(x.begin(), x.end(), max(0LL,x[i]-b))- x.begin());
r = upper_bound(x.begin(), x.end(), min((ll) last, x[i]+b)) - x.begin() - (i+1);
// cout << x[i] << " " <<l << " " << r << endl;
ans = max(l+r+1,ans);
}
return ans;
}
*/
int besthub(int n, int last, int x[], ll b){
ll ans = 0;
ll l , r;
ll cnt;
ll dl = 0, dr = 0;
for(int i = 0; i < n; i++){
cnt = 1;
ll left = b;
l = i-1,r = i+1;
while(left && (l >= 0 || r<n)){
dl = LLONG_MAX,dr = LLONG_MAX;
if(l>=0) dl= x[i]-x[l];
if(r<n )dr = x[r]-x[i];
if(l>= 0 && (r==n || dl <= dr)){
if(left<dl) break;
left-= dl;
l--;
}
else{
if(left<dr) break;
left-= dr;
r++;
}
cnt++;
}
ans = max(ans,cnt);
}
return ans;
}
| # |
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 |
344 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
448 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 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 11 |
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 |
1 ms |
348 KB |
Output is correct |
| 4 |
Correct |
1 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 |
1 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 |
Correct |
1 ms |
348 KB |
Output is correct |
| 14 |
Correct |
1 ms |
348 KB |
Output is correct |
| 15 |
Correct |
1 ms |
348 KB |
Output is correct |
| 16 |
Correct |
1 ms |
348 KB |
Output is correct |
| 17 |
Correct |
2 ms |
348 KB |
Output is correct |
| 18 |
Correct |
2 ms |
348 KB |
Output is correct |
| 19 |
Correct |
3 ms |
348 KB |
Output is correct |
| 20 |
Correct |
3 ms |
348 KB |
Output is correct |
| 21 |
Correct |
3 ms |
480 KB |
Output is correct |
| 22 |
Correct |
2 ms |
348 KB |
Output is correct |
| 23 |
Correct |
28 ms |
492 KB |
Output is correct |
| 24 |
Correct |
26 ms |
348 KB |
Output is correct |
| 25 |
Correct |
78 ms |
348 KB |
Output is correct |
| 26 |
Correct |
74 ms |
344 KB |
Output is correct |
| 27 |
Correct |
18 ms |
344 KB |
Output is correct |
| 28 |
Correct |
18 ms |
344 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
600 KB |
Output is correct |
| 2 |
Correct |
7 ms |
660 KB |
Output is correct |
| 3 |
Execution timed out |
1050 ms |
1880 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
