Submission #492526

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
492526	2021-12-07T17:27:53 Z	aris12345678	Lost in the cycle (IOI19_cycle)	C++14	11 / 100	1 ms	200 KB

cycle

#include <bits/stdc++.h>
#include "cycle.h"
using namespace std;

const int mxN = 1e9+5;
// int m, p, cnt = 0;
//
// bool jump(int x) {
//     cnt++;
//     cout << p << " -> ";
//     p += x;
//     p %= m;
//     cout << p << "\n";
//     cout << cnt << "\n";
//     if(p == 0)
//         return true;
//     return (m-p) <= m/2;
// }

void escape(int n) {
    if(jump(0))
        jump(n/2);
    while(!jump(1)) continue;
    jump(n/2);
}

// int main() {
//     scanf("%d %d", &m, &p);
//     escape(m);
//     return 0;
// }

Subtask #1

11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	200 KB	Output is correct
2	Correct	0 ms	200 KB	Output is correct
3	Correct	0 ms	200 KB	Output is correct
4	Correct	0 ms	200 KB	Output is correct
5	Correct	0 ms	200 KB	Output is correct
6	Correct	1 ms	200 KB	Output is correct
7	Correct	1 ms	200 KB	Output is correct
8	Correct	0 ms	200 KB	Output is correct
9	Correct	1 ms	200 KB	Output is correct
10	Correct	0 ms	200 KB	Output is correct
11	Correct	0 ms	200 KB	Output is correct
12	Correct	0 ms	200 KB	Output is correct
13	Correct	0 ms	200 KB	Output is correct
14	Correct	1 ms	200 KB	Output is correct
15	Correct	1 ms	200 KB	Output is correct
16	Correct	0 ms	200 KB	Output is correct
17	Correct	1 ms	200 KB	Output is correct
18	Correct	1 ms	200 KB	Output is correct
19	Correct	1 ms	200 KB	Output is correct
20	Correct	1 ms	200 KB	Output is correct
21	Correct	0 ms	200 KB	Output is correct
22	Correct	1 ms	200 KB	Output is correct
23	Correct	1 ms	200 KB	Output is correct
24	Correct	1 ms	200 KB	Output is correct
25	Correct	1 ms	200 KB	Output is correct
26	Correct	1 ms	200 KB	Output is correct
27	Correct	1 ms	200 KB	Output is correct
28	Correct	1 ms	200 KB	Output is correct
29	Correct	1 ms	200 KB	Output is correct

Subtask #2

0 / 33.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	200 KB	Output is correct
2	Correct	1 ms	200 KB	Output is correct
3	Correct	1 ms	200 KB	Output is correct
4	Incorrect	1 ms	200 KB	Too many queries.
5	Halted	0 ms	0 KB	-

Subtask #3

0 / 56.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	200 KB	Output is correct
2	Correct	0 ms	200 KB	Output is correct
3	Correct	0 ms	200 KB	Output is correct
4	Correct	0 ms	200 KB	Output is correct
5	Correct	0 ms	200 KB	Output is correct
6	Correct	1 ms	200 KB	Output is correct
7	Correct	1 ms	200 KB	Output is correct
8	Correct	0 ms	200 KB	Output is correct
9	Correct	1 ms	200 KB	Output is correct
10	Correct	0 ms	200 KB	Output is correct
11	Correct	0 ms	200 KB	Output is correct
12	Correct	0 ms	200 KB	Output is correct
13	Correct	0 ms	200 KB	Output is correct
14	Correct	1 ms	200 KB	Output is correct
15	Correct	1 ms	200 KB	Output is correct
16	Correct	0 ms	200 KB	Output is correct
17	Correct	1 ms	200 KB	Output is correct
18	Correct	1 ms	200 KB	Output is correct
19	Correct	1 ms	200 KB	Output is correct
20	Correct	1 ms	200 KB	Output is correct
21	Correct	0 ms	200 KB	Output is correct
22	Correct	1 ms	200 KB	Output is correct
23	Correct	1 ms	200 KB	Output is correct
24	Correct	1 ms	200 KB	Output is correct
25	Correct	1 ms	200 KB	Output is correct
26	Correct	1 ms	200 KB	Output is correct
27	Correct	1 ms	200 KB	Output is correct
28	Correct	1 ms	200 KB	Output is correct
29	Correct	1 ms	200 KB	Output is correct
30	Correct	1 ms	200 KB	Output is correct
31	Correct	1 ms	200 KB	Output is correct
32	Correct	1 ms	200 KB	Output is correct
33	Incorrect	1 ms	200 KB	Too many queries.
34	Halted	0 ms	0 KB	-