답안 #599871

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
599871	2022-07-20T04:48:27 Z	jophyyjh	Lost in the cycle (IOI19_cycle)	C++14	100 / 100	1 ms	288 KB

cycle

/**
 * Simple.
 * 
 * Steps needed: log_2(n)
 * Implementation 1
*/

#include <bits/stdc++.h>
#include "cycle.h"


int n;
int pos = 0;

// treat our initial (unknown) starting room as room 0. Provides jumping with
// absolute coordinate
inline int absolute_jump(int k) {
    int steps = (k - pos + n) % n;
    pos = k;
    bool ans = jump(steps);
    // std::cerr << k << ' ' << ans << std::endl;
    return ans;
}

void escape(int _n) {
    n = _n;
    bool a = absolute_jump(0), b = absolute_jump(n / 2);
    assert(a || b);
    if (a && b) {
        if (absolute_jump(1))
            absolute_jump(n / 2);
        else
            absolute_jump(0);
        return;
    }
    int left = 0, right = n / 2;
    if (b && !a) {
        std::swap(left, right);
        std::swap(a, b);
    }
    assert(a && !b);

    while (left != right) {
        int dist = (right - left + n) % n;
        int mid = left + (dist + 1) / 2;
        if (absolute_jump(mid))
            left = (mid + n) % n;
        else
            right = (mid - 1 + n) % n;
    }
    absolute_jump(left);
}

Subtask #1

11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	0 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	1 ms	208 KB	Output is correct
8	Correct	1 ms	208 KB	Output is correct
9	Correct	0 ms	208 KB	Output is correct
10	Correct	0 ms	208 KB	Output is correct
11	Correct	1 ms	208 KB	Output is correct
12	Correct	0 ms	208 KB	Output is correct
13	Correct	1 ms	208 KB	Output is correct
14	Correct	1 ms	208 KB	Output is correct
15	Correct	0 ms	208 KB	Output is correct
16	Correct	0 ms	208 KB	Output is correct
17	Correct	0 ms	208 KB	Output is correct
18	Correct	0 ms	208 KB	Output is correct
19	Correct	0 ms	208 KB	Output is correct
20	Correct	0 ms	208 KB	Output is correct
21	Correct	1 ms	208 KB	Output is correct
22	Correct	1 ms	208 KB	Output is correct
23	Correct	1 ms	208 KB	Output is correct
24	Correct	1 ms	208 KB	Output is correct
25	Correct	1 ms	208 KB	Output is correct
26	Correct	0 ms	208 KB	Output is correct
27	Correct	0 ms	208 KB	Output is correct
28	Correct	0 ms	208 KB	Output is correct
29	Correct	1 ms	208 KB	Output is correct

Subtask #2

33.0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	0 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	0 ms	208 KB	Output is correct
8	Correct	0 ms	208 KB	Output is correct
9	Correct	1 ms	208 KB	Output is correct
10	Correct	0 ms	208 KB	Output is correct
11	Correct	1 ms	208 KB	Output is correct
12	Correct	1 ms	208 KB	Output is correct
13	Correct	1 ms	208 KB	Output is correct
14	Correct	1 ms	208 KB	Output is correct
15	Correct	1 ms	208 KB	Output is correct

Subtask #3

56.0 / 56.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	0 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	1 ms	208 KB	Output is correct
8	Correct	1 ms	208 KB	Output is correct
9	Correct	0 ms	208 KB	Output is correct
10	Correct	0 ms	208 KB	Output is correct
11	Correct	1 ms	208 KB	Output is correct
12	Correct	0 ms	208 KB	Output is correct
13	Correct	1 ms	208 KB	Output is correct
14	Correct	1 ms	208 KB	Output is correct
15	Correct	0 ms	208 KB	Output is correct
16	Correct	0 ms	208 KB	Output is correct
17	Correct	0 ms	208 KB	Output is correct
18	Correct	0 ms	208 KB	Output is correct
19	Correct	0 ms	208 KB	Output is correct
20	Correct	0 ms	208 KB	Output is correct
21	Correct	1 ms	208 KB	Output is correct
22	Correct	1 ms	208 KB	Output is correct
23	Correct	1 ms	208 KB	Output is correct
24	Correct	1 ms	208 KB	Output is correct
25	Correct	1 ms	208 KB	Output is correct
26	Correct	0 ms	208 KB	Output is correct
27	Correct	0 ms	208 KB	Output is correct
28	Correct	0 ms	208 KB	Output is correct
29	Correct	1 ms	208 KB	Output is correct
30	Correct	0 ms	208 KB	Output is correct
31	Correct	0 ms	208 KB	Output is correct
32	Correct	0 ms	208 KB	Output is correct
33	Correct	0 ms	208 KB	Output is correct
34	Correct	0 ms	208 KB	Output is correct
35	Correct	1 ms	208 KB	Output is correct
36	Correct	0 ms	208 KB	Output is correct
37	Correct	0 ms	208 KB	Output is correct
38	Correct	1 ms	208 KB	Output is correct
39	Correct	0 ms	208 KB	Output is correct
40	Correct	1 ms	208 KB	Output is correct
41	Correct	1 ms	208 KB	Output is correct
42	Correct	1 ms	208 KB	Output is correct
43	Correct	1 ms	208 KB	Output is correct
44	Correct	1 ms	208 KB	Output is correct
45	Correct	0 ms	208 KB	Output is correct
46	Correct	0 ms	208 KB	Output is correct
47	Correct	1 ms	208 KB	Output is correct
48	Correct	1 ms	252 KB	Output is correct
49	Correct	1 ms	208 KB	Output is correct
50	Correct	1 ms	208 KB	Output is correct
51	Correct	1 ms	208 KB	Output is correct
52	Correct	1 ms	208 KB	Output is correct
53	Correct	1 ms	208 KB	Output is correct
54	Correct	1 ms	208 KB	Output is correct
55	Correct	1 ms	208 KB	Output is correct
56	Correct	1 ms	208 KB	Output is correct
57	Correct	0 ms	288 KB	Output is correct
58	Correct	1 ms	208 KB	Output is correct
59	Correct	1 ms	208 KB	Output is correct
60	Correct	1 ms	208 KB	Output is correct
61	Correct	1 ms	208 KB	Output is correct