#include "bits/stdc++.h"
#include "ricehub.h"
using namespace std;
long long S(int X[], int h, int l, int r)
{
long long sum = 0;
for(int i = l; i<=r; i++)
sum = sum + abs(h-X[i]);
return sum;
}
int besthub(int R, int L, int X[], long long B)
{
int res = 0;
for(int l = 0; l<R; l++)
{
for(int r = l; r<R; r++)
{
int h = X[(l+r)/2];
long long curr = S(X, h, l, r);
if(curr <=B)
res = max(res, r-l+1);
}
}
return res;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
416 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
9 |
Correct |
1 ms |
204 KB |
Output is correct |
10 |
Correct |
1 ms |
204 KB |
Output is correct |
11 |
Correct |
1 ms |
284 KB |
Output is correct |
12 |
Correct |
1 ms |
204 KB |
Output is correct |
13 |
Correct |
1 ms |
204 KB |
Output is correct |
14 |
Correct |
1 ms |
204 KB |
Output is correct |
15 |
Correct |
1 ms |
204 KB |
Output is correct |
16 |
Correct |
1 ms |
204 KB |
Output is correct |
17 |
Correct |
1 ms |
204 KB |
Output is correct |
18 |
Correct |
1 ms |
204 KB |
Output is correct |
19 |
Correct |
1 ms |
204 KB |
Output is correct |
20 |
Correct |
1 ms |
304 KB |
Output is correct |
21 |
Correct |
21 ms |
304 KB |
Output is correct |
22 |
Correct |
21 ms |
204 KB |
Output is correct |
23 |
Correct |
22 ms |
304 KB |
Output is correct |
24 |
Correct |
22 ms |
204 KB |
Output is correct |
25 |
Correct |
23 ms |
304 KB |
Output is correct |
26 |
Correct |
22 ms |
300 KB |
Output is correct |
27 |
Correct |
21 ms |
204 KB |
Output is correct |
28 |
Correct |
21 ms |
312 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
204 KB |
Output is correct |
2 |
Correct |
2 ms |
204 KB |
Output is correct |
3 |
Correct |
125 ms |
204 KB |
Output is correct |
4 |
Correct |
126 ms |
296 KB |
Output is correct |
5 |
Correct |
23 ms |
204 KB |
Output is correct |
6 |
Correct |
21 ms |
204 KB |
Output is correct |
7 |
Correct |
157 ms |
296 KB |
Output is correct |
8 |
Correct |
163 ms |
300 KB |
Output is correct |
9 |
Correct |
21 ms |
204 KB |
Output is correct |
10 |
Correct |
21 ms |
308 KB |
Output is correct |
11 |
Correct |
82 ms |
308 KB |
Output is correct |
12 |
Correct |
82 ms |
204 KB |
Output is correct |
13 |
Correct |
168 ms |
204 KB |
Output is correct |
14 |
Correct |
169 ms |
304 KB |
Output is correct |
15 |
Correct |
22 ms |
300 KB |
Output is correct |
16 |
Correct |
23 ms |
204 KB |
Output is correct |
17 |
Correct |
87 ms |
296 KB |
Output is correct |
18 |
Correct |
90 ms |
204 KB |
Output is correct |
19 |
Correct |
171 ms |
292 KB |
Output is correct |
20 |
Correct |
170 ms |
288 KB |
Output is correct |
21 |
Execution timed out |
1086 ms |
332 KB |
Time limit exceeded |
22 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1083 ms |
460 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |