#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
vector<long long> vec;
int besthub(int R, int L, int X[], long long B)
{
int ans = 0;
for(int i=0;i<R;i++) {
int now = 0;
vec.clear();
for(int j=0;j<R;j++) {
vec.push_back(abs(X[j] - X[i]));
}
sort(vec.begin(), vec.end());
long long cou = 0;
for(auto t:vec) {
cou += t;
if (cou>B) break;
now++;
}
ans = max(ans, now);
}
return ans;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 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 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
0 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 |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
0 ms |
212 KB |
Output is correct |
| 10 |
Correct |
0 ms |
212 KB |
Output is correct |
| 11 |
Correct |
0 ms |
212 KB |
Output is correct |
| 12 |
Correct |
1 ms |
212 KB |
Output is correct |
| 13 |
Correct |
0 ms |
212 KB |
Output is correct |
| 14 |
Correct |
1 ms |
212 KB |
Output is correct |
| 15 |
Correct |
1 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 |
1 ms |
212 KB |
Output is correct |
| 19 |
Correct |
1 ms |
212 KB |
Output is correct |
| 20 |
Correct |
1 ms |
212 KB |
Output is correct |
| 21 |
Correct |
3 ms |
212 KB |
Output is correct |
| 22 |
Correct |
3 ms |
212 KB |
Output is correct |
| 23 |
Correct |
6 ms |
212 KB |
Output is correct |
| 24 |
Correct |
6 ms |
212 KB |
Output is correct |
| 25 |
Correct |
5 ms |
212 KB |
Output is correct |
| 26 |
Correct |
6 ms |
212 KB |
Output is correct |
| 27 |
Correct |
6 ms |
212 KB |
Output is correct |
| 28 |
Correct |
5 ms |
316 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
18 ms |
328 KB |
Output is correct |
| 4 |
Correct |
20 ms |
212 KB |
Output is correct |
| 5 |
Correct |
3 ms |
212 KB |
Output is correct |
| 6 |
Correct |
3 ms |
212 KB |
Output is correct |
| 7 |
Correct |
13 ms |
212 KB |
Output is correct |
| 8 |
Correct |
12 ms |
212 KB |
Output is correct |
| 9 |
Correct |
5 ms |
212 KB |
Output is correct |
| 10 |
Correct |
5 ms |
212 KB |
Output is correct |
| 11 |
Correct |
13 ms |
328 KB |
Output is correct |
| 12 |
Correct |
14 ms |
212 KB |
Output is correct |
| 13 |
Correct |
23 ms |
212 KB |
Output is correct |
| 14 |
Correct |
23 ms |
212 KB |
Output is correct |
| 15 |
Correct |
5 ms |
212 KB |
Output is correct |
| 16 |
Correct |
5 ms |
320 KB |
Output is correct |
| 17 |
Correct |
13 ms |
212 KB |
Output is correct |
| 18 |
Correct |
13 ms |
324 KB |
Output is correct |
| 19 |
Correct |
20 ms |
212 KB |
Output is correct |
| 20 |
Correct |
22 ms |
324 KB |
Output is correct |
| 21 |
Correct |
353 ms |
416 KB |
Output is correct |
| 22 |
Correct |
343 ms |
412 KB |
Output is correct |
| 23 |
Correct |
719 ms |
412 KB |
Output is correct |
| 24 |
Correct |
759 ms |
416 KB |
Output is correct |
| 25 |
Correct |
687 ms |
416 KB |
Output is correct |
| 26 |
Correct |
695 ms |
416 KB |
Output is correct |
| 27 |
Correct |
643 ms |
416 KB |
Output is correct |
| 28 |
Correct |
678 ms |
416 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1070 ms |
724 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
