| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 28849 |
2017-07-17T10:42:56 Z |
kavun |
Rice Hub (IOI11_ricehub) |
C++14 |
|
1000 ms |
5924 KB |
#include "ricehub.h"
#include <bits/stdc++.h>
#include "ricehub.h"
using namespace std;
typedef long long ll;
int besthub(int R, int L, int X[], long long B)
{
for(int res = R; res > 0; res--)
{
for(int i = 0; i <= R - res; i++)
{
int median = i + (res - 1) / 2;
ll cost = 0;
for(int j = i; j < i+res; j++)
{
cost += abs(X[j] - X[median]);
}
if(cost <= B)
return res;
}
}
return 1;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 2 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 3 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 4 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 5 |
Correct |
0 ms |
5924 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 2 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 3 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 4 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 5 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 6 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 7 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 8 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 9 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 10 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 11 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 12 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 13 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 14 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 15 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 16 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 17 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 18 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 19 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 20 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 21 |
Correct |
26 ms |
5924 KB |
Output is correct |
| 22 |
Correct |
26 ms |
5924 KB |
Output is correct |
| 23 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 24 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 25 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 26 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 27 |
Correct |
19 ms |
5924 KB |
Output is correct |
| 28 |
Correct |
13 ms |
5924 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 2 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 3 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 4 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 5 |
Correct |
26 ms |
5924 KB |
Output is correct |
| 6 |
Correct |
26 ms |
5924 KB |
Output is correct |
| 7 |
Correct |
213 ms |
5924 KB |
Output is correct |
| 8 |
Correct |
206 ms |
5924 KB |
Output is correct |
| 9 |
Correct |
26 ms |
5924 KB |
Output is correct |
| 10 |
Correct |
23 ms |
5924 KB |
Output is correct |
| 11 |
Correct |
123 ms |
5924 KB |
Output is correct |
| 12 |
Correct |
103 ms |
5924 KB |
Output is correct |
| 13 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 14 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 15 |
Correct |
19 ms |
5924 KB |
Output is correct |
| 16 |
Correct |
16 ms |
5924 KB |
Output is correct |
| 17 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 18 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 19 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 20 |
Correct |
0 ms |
5924 KB |
Output is correct |
| 21 |
Execution timed out |
1000 ms |
5924 KB |
Execution timed out |
| 22 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1000 ms |
5924 KB |
Execution timed out |
| 2 |
Halted |
0 ms |
0 KB |
- |
