#include "springboard.h"
#include <stdio.h>
void Reorder(int N) {
int rem = N>>1;
int dir = PutBall(1+rem);
while (rem>1) {
rem >>= 1;
if (dir > 0) dir = PutBall(N - rem + 1);// , printf("put %d, d=%d\n", N - rem + 1, dir);
else dir = PutBall(1 + rem);// , printf("put %d, d=%d\n", rem, dir);
}
if (dir > 0) {
dir=PutBall(N);
if (dir < 0) PutBall(1);
}
else {
dir=PutBall(1);
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
256 KB |
Output is correct |
2 |
Correct |
3 ms |
256 KB |
Output is correct |
3 |
Correct |
3 ms |
256 KB |
Output is correct |
4 |
Correct |
3 ms |
384 KB |
Output is correct |
5 |
Runtime error |
4 ms |
384 KB |
Execution failed because the return code was nonzero |
6 |
Halted |
0 ms |
0 KB |
- |