#include "bits/stdc++.h"
#include "ricehub.h"
using namespace std;
using ll = long long;
using vi = vector<long long>;
#define pb emplace_back
ll check(int x, int R, int X[], ll B) {
vi cost;
for(int i = 0; i < R; ++i) {
cost.pb(abs(X[i] - x));
}
sort(cost.begin(), cost.end());
ll cnt = 0;
ll sum = 0;
for(int i = 0; i < (int) cost.size(); ++i) {
if(sum + cost[i] > B)
return cnt;
++cnt;
sum += cost[i];
}
return cnt;
}
int besthub(int R, int L, int X[], long long B)
{
ll ans = 0;
for(int i = 0; i <= L; ++i) {
ans = max(ans, check(i, R, X, B));
}
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
312 KB |
Output is correct |
3 |
Correct |
1 ms |
312 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
312 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
312 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
2 ms |
212 KB |
Output is correct |
8 |
Correct |
2 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
308 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
304 KB |
Output is correct |
14 |
Correct |
1 ms |
296 KB |
Output is correct |
15 |
Correct |
2 ms |
212 KB |
Output is correct |
16 |
Correct |
2 ms |
316 KB |
Output is correct |
17 |
Correct |
1 ms |
212 KB |
Output is correct |
18 |
Correct |
1 ms |
316 KB |
Output is correct |
19 |
Correct |
2 ms |
212 KB |
Output is correct |
20 |
Correct |
2 ms |
212 KB |
Output is correct |
21 |
Correct |
6 ms |
212 KB |
Output is correct |
22 |
Correct |
6 ms |
316 KB |
Output is correct |
23 |
Correct |
93 ms |
296 KB |
Output is correct |
24 |
Correct |
101 ms |
300 KB |
Output is correct |
25 |
Correct |
85 ms |
308 KB |
Output is correct |
26 |
Correct |
87 ms |
212 KB |
Output is correct |
27 |
Correct |
72 ms |
212 KB |
Output is correct |
28 |
Correct |
81 ms |
316 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
22 ms |
212 KB |
Output is correct |
2 |
Correct |
25 ms |
312 KB |
Output is correct |
3 |
Execution timed out |
1078 ms |
212 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1062 ms |
992 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |