#include "ricehub.h"
#include "bits/stdc++.h"
#define ll long long
using namespace std;
int besthub(int R, int L, int X[], long long B){
int answer = 0;
for (int i = 1; i <= L; i++){
vector<int> dist;
for (int j = 0; j < R; j++)
dist.push_back(abs(X[j] - i));
sort(dist.begin(), dist.end());
ll budget = 0;
int count = 0;
for (auto x: dist){
budget += x;
if (budget > B)
break;
count += 1;
}
answer = max(answer, count);
}
return answer;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
304 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
316 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
316 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
2 ms |
312 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
13 |
Correct |
0 ms |
316 KB |
Output is correct |
14 |
Correct |
1 ms |
212 KB |
Output is correct |
15 |
Correct |
2 ms |
212 KB |
Output is correct |
16 |
Correct |
1 ms |
212 KB |
Output is correct |
17 |
Correct |
1 ms |
212 KB |
Output is correct |
18 |
Correct |
0 ms |
212 KB |
Output is correct |
19 |
Correct |
2 ms |
212 KB |
Output is correct |
20 |
Correct |
2 ms |
212 KB |
Output is correct |
21 |
Correct |
4 ms |
212 KB |
Output is correct |
22 |
Correct |
4 ms |
212 KB |
Output is correct |
23 |
Correct |
85 ms |
296 KB |
Output is correct |
24 |
Correct |
71 ms |
300 KB |
Output is correct |
25 |
Correct |
69 ms |
312 KB |
Output is correct |
26 |
Correct |
69 ms |
296 KB |
Output is correct |
27 |
Correct |
61 ms |
340 KB |
Output is correct |
28 |
Correct |
58 ms |
300 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
16 ms |
212 KB |
Output is correct |
2 |
Correct |
16 ms |
340 KB |
Output is correct |
3 |
Execution timed out |
1067 ms |
212 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1069 ms |
736 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |