Submission #212143

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
212143	2020-03-22T11:06:51 Z	MarcoMeijer	Lost in the cycle (IOI19_cycle)	C++14	11 / 100	6 ms	384 KB

cycle

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

//macros
typedef long long ll;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define INF 1e9
#define pb push_back
#define fi first
#define se second
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

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

Subtask #1

11.0 / 11.0

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

Subtask #2

0 / 33.0

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

Subtask #3

0 / 56.0

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