# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
28584 | 2017-07-16T07:40:53 Z | Official Fan of ACG(#1221, cseteram, 16silver, pps789) | LR Springboard (FXCUP2_springboard) | C++14 | 3 ms | 1132 KB |
#include "springboard.h" void Reorder(int N) { int x, p, flip; if (N == 1){ flip = PutBall(1); if (flip == -1) PutBall(1); } else if (N == 2){ flip = PutBall(1); if (flip == -1) flip = PutBall(1); if (flip == -1) flip = PutBall(1); } else if (N == 3){ flip = PutBall(1); if (flip == -1) flip = PutBall(1); if (flip == -1) flip = PutBall(1); if (flip == -1) flip = PutBall(1); } else{ flip = PutBall(N / 2); p = N / 2; if (N % 2 == 0){ while (p > 1){ if (flip == 1) flip = PutBall(N + 1 - p); else flip = PutBall(p); p = (p + 1) / 2; } if (flip == 1) flip = PutBall(N); else flip = PutBall(1); } else{ while (p > 1){ if (flip == 1) flip = PutBall(N + 1 - p); else flip = PutBall(p); p = (p + 1) / 2; } if (flip == 1) flip = PutBall(N); else flip = PutBall(1); } if (flip == -1) PutBall(1); } }
Compilation message
# | 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 | 0 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 | 3 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 |