# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
224520 |
2020-04-18T09:50:49 Z |
T0p_ |
Rice Hub (IOI11_ricehub) |
C++14 |
|
10 ms |
512 KB |
#include <bits/stdc++.h>
#include "ricehub.h"
using namespace std;
int besthub(int R, int L, int X[], long long B)
{
int ans = 0;
for(int i=0 ; i<R ; i++)
{
long long temp = B;
int l=i-1, r=i+1, now = 0;
while(l >= 0 && r < R)
{
if(temp < X[i] - X[l] && temp < X[r] - X[i]) break ;
if(X[i] - X[l] <= X[r] - X[i])
{
temp -= (X[i] - X[l]);
l--;
now++;
}
else
{
temp -= (X[r] - X[i]);
r++;
now++;
}
}
while(l >= 0)
{
if(temp < X[i] - X[l]) break ;
temp -= (X[i] - X[l]);
l--;
now++;
}
while(r < R)
{
if(temp < X[r] - X[i]) break ;
temp -= (X[r] - X[i]);
r++;
now++;
}
ans = max(ans, now);
}
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
256 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
10 ms |
512 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |