#include "springboard.h"
int Rmi, Rmx, Rmd;
void Reorder(int N) {
if(PutBall((N+1)/2) == 1){
PutBall((N+1)/2);
Rmi = (N+1)/2, Rmx = N;
}
else{
PutBall(N/2+1);
Rmi = 0, Rmx = N/2;
}
while(Rmi < Rmx){
Rmd = (Rmi+Rmx) / 2;
int res = PutBall(N-Rmd);
if(res < 0) Rmi += N-Rmd, Rmx = N;
else Rmi = 0, Rmx = Rmx+N-Rmd - (N+1);
}
if(Rmi) PutBall(N+1-Rmi);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1132 KB |
Output is correct |
2 |
Correct |
0 ms |
1132 KB |
Output is correct |
3 |
Correct |
0 ms |
1132 KB |
Output is correct |
4 |
Correct |
0 ms |
1132 KB |
Output is correct |
5 |
Correct |
0 ms |
1132 KB |
Output is correct |
6 |
Correct |
0 ms |
1132 KB |
Output is correct |
7 |
Correct |
0 ms |
1132 KB |
Output is correct |
8 |
Correct |
0 ms |
1132 KB |
Output is correct |
9 |
Correct |
0 ms |
1132 KB |
Output is correct |
10 |
Correct |
0 ms |
1132 KB |
Output is correct |
11 |
Correct |
0 ms |
1132 KB |
Output is correct |
12 |
Correct |
0 ms |
1132 KB |
Output is correct |
13 |
Correct |
0 ms |
1132 KB |
Output is correct |
14 |
Correct |
0 ms |
1132 KB |
Output is correct |
15 |
Correct |
0 ms |
1132 KB |
Output is correct |
16 |
Correct |
0 ms |
1132 KB |
Output is correct |
17 |
Correct |
0 ms |
1132 KB |
Output is correct |
18 |
Correct |
0 ms |
1132 KB |
Output is correct |
19 |
Correct |
0 ms |
1132 KB |
Output is correct |
20 |
Correct |
0 ms |
1132 KB |
Output is correct |
21 |
Correct |
0 ms |
1132 KB |
Output is correct |
22 |
Correct |
0 ms |
1132 KB |
Output is correct |
23 |
Correct |
0 ms |
1132 KB |
Output is correct |
24 |
Correct |
0 ms |
1132 KB |
Output is correct |
25 |
Correct |
0 ms |
1132 KB |
Output is correct |
26 |
Correct |
0 ms |
1132 KB |
Output is correct |
27 |
Correct |
0 ms |
1132 KB |
Output is correct |
28 |
Correct |
0 ms |
1132 KB |
Output is correct |
29 |
Correct |
0 ms |
1132 KB |
Output is correct |
30 |
Correct |
3 ms |
1132 KB |
Output is correct |
31 |
Correct |
0 ms |
1132 KB |
Output is correct |
32 |
Correct |
0 ms |
1132 KB |
Output is correct |
33 |
Correct |
0 ms |
1132 KB |
Output is correct |
34 |
Correct |
0 ms |
1132 KB |
Output is correct |
35 |
Correct |
0 ms |
1132 KB |
Output is correct |
36 |
Correct |
0 ms |
1132 KB |
Output is correct |
37 |
Correct |
0 ms |
1132 KB |
Output is correct |
38 |
Correct |
0 ms |
1132 KB |
Output is correct |
39 |
Correct |
0 ms |
1132 KB |
Output is correct |
40 |
Correct |
0 ms |
1132 KB |
Output is correct |
41 |
Correct |
0 ms |
1132 KB |
Output is correct |