| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 13484 |
2015-02-21T21:52:13 Z |
ainta |
Rice Hub (IOI11_ricehub) |
C++ |
|
15 ms |
4988 KB |
#include "ricehub.h"
int besthub(int R, int L, int X[], long long B)
{
int i, be, ed, t, Res = 0;
long long S = 0;
for (i = 0; i < R; i++){
if (i == 0)be = 0, ed = 0, S = 0;
if (ed < i)be = ed = i, S = 0;
t = i * 2 - ed - 2;
if (be == t){
S -= (X[i] - X[be]);
be++;
}
t = i * 2 - ed - 1;
if (be == t){
S -= (X[i] - X[be]);
be++;
}
while (be - 1 >= 0 && ed + 1 < R){
if (S + X[ed + 1] - X[be - 1] > B)break;
S += X[ed + 1] - X[be - 1];
be--, ed++;
}
if (ed + 1 < R && S + X[ed + 1] - X[i]<= B){
S += X[ed + 1] - X[i];
ed++;
}
if (Res < ed - be + 1)Res = ed - be + 1;
if (i != R - 1 && be + ed == i * 2){
S += 2 * (X[i + 1] - X[i]);
}
}
return Res;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
4988 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 2 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 3 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 4 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 5 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 6 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 7 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 8 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 9 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 10 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 11 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 12 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 13 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 14 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 15 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 16 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 17 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 18 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 19 |
Incorrect |
0 ms |
4988 KB |
Output isn't correct |
| 20 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 2 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 3 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 4 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 5 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 6 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 7 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 8 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 9 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 10 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 11 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 12 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 13 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 14 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 15 |
Incorrect |
0 ms |
4988 KB |
Output isn't correct |
| 16 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
4988 KB |
Output is correct |
| 2 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 3 |
Correct |
12 ms |
4988 KB |
Output is correct |
| 4 |
Correct |
12 ms |
4988 KB |
Output is correct |
| 5 |
Correct |
6 ms |
4988 KB |
Output is correct |
| 6 |
Correct |
6 ms |
4988 KB |
Output is correct |
| 7 |
Correct |
12 ms |
4988 KB |
Output is correct |
| 8 |
Correct |
10 ms |
4988 KB |
Output is correct |
| 9 |
Correct |
7 ms |
4988 KB |
Output is correct |
| 10 |
Correct |
7 ms |
4988 KB |
Output is correct |
| 11 |
Correct |
15 ms |
4988 KB |
Output is correct |
| 12 |
Correct |
0 ms |
4988 KB |
Output is correct |
| 13 |
Incorrect |
9 ms |
4988 KB |
Output isn't correct |
| 14 |
Halted |
0 ms |
0 KB |
- |
