#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long long ma=-1;
int besthub(int R, int L, int X[], long long B){
vector<ll>T;
T.push_back(0);
for(int i=0;i<R;i++){
T.push_back(X[i]+T[T.size()-1]);
}
for(int i=0;i<R;i++){
for(int j=i+1;j<R;j++){
ll mi=(i+j)/2;
if((mi-i)*X[mi]-(T[mi]-T[i])+(T[j+1]-T[mi+1])-(j-mi)*X[mi]<=B){
ma=max(ma,(ll)(j-i)+1);
}
}
}
return ma;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
4 ms |
256 KB |
Output is correct |
3 |
Correct |
6 ms |
384 KB |
Output is correct |
4 |
Correct |
6 ms |
384 KB |
Output is correct |
5 |
Correct |
5 ms |
384 KB |
Output is correct |
6 |
Correct |
5 ms |
384 KB |
Output is correct |
7 |
Correct |
6 ms |
384 KB |
Output is correct |
8 |
Correct |
6 ms |
384 KB |
Output is correct |
9 |
Correct |
5 ms |
384 KB |
Output is correct |
10 |
Correct |
5 ms |
384 KB |
Output is correct |
11 |
Correct |
6 ms |
384 KB |
Output is correct |
12 |
Correct |
6 ms |
384 KB |
Output is correct |
13 |
Correct |
7 ms |
384 KB |
Output is correct |
14 |
Correct |
6 ms |
384 KB |
Output is correct |
15 |
Correct |
5 ms |
384 KB |
Output is correct |
16 |
Correct |
5 ms |
384 KB |
Output is correct |
17 |
Correct |
6 ms |
384 KB |
Output is correct |
18 |
Correct |
6 ms |
384 KB |
Output is correct |
19 |
Correct |
6 ms |
384 KB |
Output is correct |
20 |
Correct |
6 ms |
384 KB |
Output is correct |
21 |
Correct |
35 ms |
512 KB |
Output is correct |
22 |
Correct |
36 ms |
512 KB |
Output is correct |
23 |
Correct |
44 ms |
512 KB |
Output is correct |
24 |
Correct |
44 ms |
512 KB |
Output is correct |
25 |
Correct |
44 ms |
512 KB |
Output is correct |
26 |
Correct |
45 ms |
512 KB |
Output is correct |
27 |
Correct |
42 ms |
512 KB |
Output is correct |
28 |
Correct |
42 ms |
512 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
476 ms |
896 KB |
Output is correct |
2 |
Correct |
477 ms |
896 KB |
Output is correct |
3 |
Execution timed out |
1098 ms |
2936 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |