# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
224627 |
2020-04-18T14:07:12 Z |
AASG |
Rice Hub (IOI11_ricehub) |
C++11 |
|
1000 ms |
512 KB |
#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
int besthub(int R, int L, int X[], long long B){
int mx=0;
for(int i=1;i<=L;i++){
int au=0;
long long ab=B;
deque<int> rm;
for(int l=0;l<R;l++){
rm.push_back(abs(i-X[l]));
}
sort(rm.begin(),rm.end());
long tm=rm.size();
for(int l=0;l<tm;l++){if(ab-rm[l]>=0){au++;ab=ab-rm[l];}else break;}
mx=max(mx,au);
}
R=mx;
return R;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
256 KB |
Output is correct |
2 |
Correct |
5 ms |
256 KB |
Output is correct |
3 |
Correct |
4 ms |
256 KB |
Output is correct |
4 |
Correct |
5 ms |
384 KB |
Output is correct |
5 |
Correct |
5 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
256 KB |
Output is correct |
2 |
Correct |
5 ms |
256 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
5 ms |
128 KB |
Output is correct |
5 |
Correct |
6 ms |
256 KB |
Output is correct |
6 |
Correct |
6 ms |
384 KB |
Output is correct |
7 |
Correct |
6 ms |
256 KB |
Output is correct |
8 |
Correct |
6 ms |
256 KB |
Output is correct |
9 |
Correct |
5 ms |
256 KB |
Output is correct |
10 |
Correct |
4 ms |
384 KB |
Output is correct |
11 |
Correct |
5 ms |
384 KB |
Output is correct |
12 |
Correct |
5 ms |
384 KB |
Output is correct |
13 |
Correct |
5 ms |
256 KB |
Output is correct |
14 |
Correct |
4 ms |
256 KB |
Output is correct |
15 |
Correct |
7 ms |
256 KB |
Output is correct |
16 |
Correct |
7 ms |
512 KB |
Output is correct |
17 |
Correct |
5 ms |
256 KB |
Output is correct |
18 |
Correct |
5 ms |
256 KB |
Output is correct |
19 |
Correct |
7 ms |
384 KB |
Output is correct |
20 |
Correct |
7 ms |
384 KB |
Output is correct |
21 |
Correct |
13 ms |
256 KB |
Output is correct |
22 |
Correct |
14 ms |
256 KB |
Output is correct |
23 |
Correct |
152 ms |
372 KB |
Output is correct |
24 |
Correct |
153 ms |
384 KB |
Output is correct |
25 |
Correct |
148 ms |
404 KB |
Output is correct |
26 |
Correct |
147 ms |
504 KB |
Output is correct |
27 |
Correct |
125 ms |
256 KB |
Output is correct |
28 |
Correct |
126 ms |
256 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
44 ms |
376 KB |
Output is correct |
2 |
Correct |
41 ms |
256 KB |
Output is correct |
3 |
Execution timed out |
1089 ms |
256 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1084 ms |
512 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |