#include<bits/stdc++.h>
#include "ricehub.h"
using namespace std;
int besthub(int R, int L, int X[], long long B)
{
long long mx = -1;
for(int i=1;i<=L;++i)
{
priority_queue<long long,vector<long long>,greater<long long>> pq;
for(int j=0;j<R;++j)
{
long long dist = abs(i-X[j]);
pq.push(dist);
}
long long cost = 0,rice = 0;
while(!pq.empty())
{
if(cost+pq.top() <= B)
{
cost += pq.top();
++rice;
}
else break;
pq.pop();
}
mx = max(mx,rice);
}
return mx;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
0 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 |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
2 ms |
316 KB |
Output is correct |
6 |
Correct |
2 ms |
212 KB |
Output is correct |
7 |
Correct |
3 ms |
212 KB |
Output is correct |
8 |
Correct |
3 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 |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
0 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
0 ms |
212 KB |
Output is correct |
15 |
Correct |
3 ms |
212 KB |
Output is correct |
16 |
Correct |
3 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 |
3 ms |
212 KB |
Output is correct |
20 |
Correct |
3 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 |
182 ms |
292 KB |
Output is correct |
24 |
Correct |
179 ms |
296 KB |
Output is correct |
25 |
Correct |
176 ms |
296 KB |
Output is correct |
26 |
Correct |
181 ms |
296 KB |
Output is correct |
27 |
Correct |
94 ms |
212 KB |
Output is correct |
28 |
Correct |
93 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
22 ms |
316 KB |
Output is correct |
2 |
Correct |
25 ms |
304 KB |
Output is correct |
3 |
Execution timed out |
1074 ms |
212 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1075 ms |
960 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |