# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
494010 |
2021-12-13T17:53:31 Z |
Leo121 |
Rice Hub (IOI11_ricehub) |
C++14 |
|
14 ms |
1064 KB |
#include "ricehub.h"
typedef long long ll;
int arre[100002];
ll presupuesto;
int campos;
bool probar(int campos_arroz){
ll aux = 0;
int centro = campos_arroz / 2;
if(campos_arroz % 2 == 0){
centro --;
}
for(int i = 0; i < campos_arroz; ++i){
ll aux2 = (ll) arre[centro] - (ll) arre[i];
if(aux2 < 0){
aux2 *= -1LL;
}
aux += aux2;
}
if(aux <= presupuesto){
return 1;
}
for(int i = campos_arroz; i < campos; ++i){
centro++;
aux -= ((ll) arre[centro - 1] - (ll) arre[i - campos_arroz]);
aux += ((ll) arre[i] - (ll) arre[centro]);
if(campos_arroz % 2 == 0 && campos_arroz != 2){
aux -= ((ll) arre[centro] - (ll) arre[centro - 1]);
}
if(aux <= presupuesto){
return 1;
}
}
return 0;
}
int bs(int li, int ls){
int mitad, resbs = 0;
while(li <= ls){
mitad = (li + ls) / 2;
if(probar(mitad)){
resbs = mitad;
li = mitad + 1;
}
else{
ls = mitad - 1;
}
}
return resbs;
}
int besthub(int R, int L, int X[], long long B)
{
presupuesto = B;
for(int i = 0; i < R; ++i){
arre[i] = X[i];
}
campos = R;
return bs(1, R);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
0 ms |
204 KB |
Output is correct |
7 |
Correct |
0 ms |
204 KB |
Output is correct |
8 |
Correct |
0 ms |
204 KB |
Output is correct |
9 |
Correct |
1 ms |
204 KB |
Output is correct |
10 |
Correct |
0 ms |
204 KB |
Output is correct |
11 |
Correct |
0 ms |
204 KB |
Output is correct |
12 |
Correct |
0 ms |
204 KB |
Output is correct |
13 |
Correct |
0 ms |
204 KB |
Output is correct |
14 |
Correct |
0 ms |
204 KB |
Output is correct |
15 |
Correct |
0 ms |
288 KB |
Output is correct |
16 |
Correct |
0 ms |
204 KB |
Output is correct |
17 |
Correct |
0 ms |
204 KB |
Output is correct |
18 |
Correct |
0 ms |
204 KB |
Output is correct |
19 |
Correct |
0 ms |
204 KB |
Output is correct |
20 |
Correct |
0 ms |
204 KB |
Output is correct |
21 |
Correct |
0 ms |
204 KB |
Output is correct |
22 |
Correct |
0 ms |
204 KB |
Output is correct |
23 |
Correct |
0 ms |
204 KB |
Output is correct |
24 |
Correct |
0 ms |
204 KB |
Output is correct |
25 |
Correct |
0 ms |
204 KB |
Output is correct |
26 |
Correct |
0 ms |
204 KB |
Output is correct |
27 |
Correct |
0 ms |
204 KB |
Output is correct |
28 |
Correct |
0 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
0 ms |
204 KB |
Output is correct |
7 |
Correct |
0 ms |
204 KB |
Output is correct |
8 |
Correct |
0 ms |
204 KB |
Output is correct |
9 |
Correct |
0 ms |
204 KB |
Output is correct |
10 |
Correct |
0 ms |
204 KB |
Output is correct |
11 |
Correct |
1 ms |
204 KB |
Output is correct |
12 |
Correct |
0 ms |
204 KB |
Output is correct |
13 |
Correct |
0 ms |
204 KB |
Output is correct |
14 |
Correct |
0 ms |
204 KB |
Output is correct |
15 |
Correct |
0 ms |
204 KB |
Output is correct |
16 |
Correct |
0 ms |
204 KB |
Output is correct |
17 |
Correct |
0 ms |
204 KB |
Output is correct |
18 |
Correct |
0 ms |
204 KB |
Output is correct |
19 |
Correct |
0 ms |
204 KB |
Output is correct |
20 |
Correct |
0 ms |
204 KB |
Output is correct |
21 |
Correct |
1 ms |
204 KB |
Output is correct |
22 |
Correct |
1 ms |
332 KB |
Output is correct |
23 |
Correct |
1 ms |
204 KB |
Output is correct |
24 |
Correct |
1 ms |
204 KB |
Output is correct |
25 |
Correct |
1 ms |
332 KB |
Output is correct |
26 |
Correct |
1 ms |
204 KB |
Output is correct |
27 |
Correct |
1 ms |
204 KB |
Output is correct |
28 |
Correct |
1 ms |
332 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
332 KB |
Output is correct |
2 |
Correct |
2 ms |
332 KB |
Output is correct |
3 |
Correct |
14 ms |
984 KB |
Output is correct |
4 |
Correct |
13 ms |
988 KB |
Output is correct |
5 |
Correct |
6 ms |
588 KB |
Output is correct |
6 |
Correct |
6 ms |
588 KB |
Output is correct |
7 |
Correct |
12 ms |
972 KB |
Output is correct |
8 |
Correct |
12 ms |
1060 KB |
Output is correct |
9 |
Correct |
7 ms |
604 KB |
Output is correct |
10 |
Correct |
7 ms |
668 KB |
Output is correct |
11 |
Correct |
14 ms |
1060 KB |
Output is correct |
12 |
Correct |
14 ms |
1064 KB |
Output is correct |
13 |
Correct |
6 ms |
672 KB |
Output is correct |
14 |
Correct |
6 ms |
588 KB |
Output is correct |
15 |
Correct |
10 ms |
844 KB |
Output is correct |
16 |
Correct |
10 ms |
868 KB |
Output is correct |
17 |
Correct |
13 ms |
972 KB |
Output is correct |
18 |
Correct |
12 ms |
960 KB |
Output is correct |
19 |
Correct |
13 ms |
976 KB |
Output is correct |
20 |
Correct |
13 ms |
1016 KB |
Output is correct |