oj.uz

Submission #28442

# Submission time Handle Problem Language Result Execution time Memory
28442 2017-07-16T05:58:27 Z AcornCkiGuiziTeam(#1202, dotorya, cki86201, zigui) LR Springboard (FXCUP2_springboard) C++11
1 / 1
 3 ms 1132 KB 
#include "springboard.h"
#include <stdio.h>

void Reorder(int N) {
    int a = PutBall((N+1)/2);
    int b = PutBall((N+1)/2);
    if(a == b) {
        if(a == -1) PutBall(1);
        return;
    }
    int L = (N+1) / 2, state = a;
    while(L) {
        int x = (L + 1) / 2;
        if(state == 1) {
            int t = PutBall(x);
            if(t == 1) {
                L = x - 1;
                state = 2;
            }
            else {
                L = L - x;
            }
        }
        else {
            int t = PutBall(N + 1 - x);
            if(t == -1) {
                L = x - 1;
                state = 1;
            }
            else {
                L = L - x;
            }
        }
    }
    if(state == 1) PutBall(1);
}

Subtask #1
1.0 / 1.0

# 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 3 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 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