oj.uz

Submission #226534

# Submission time Handle Problem Language Result Execution time Memory
226534 2020-04-24T08:04:39 Z jiahng Lost in the cycle (IOI19_cycle) C++17
100 / 100
 5 ms 512 KB 
#include <bits/stdc++.h>
#include "cycle.h"
using namespace std;

typedef long long ll;
typedef pair<ll,ll> pi;
typedef vector <ll> vi;
typedef vector <pi> vpi;
#define f first
#define s second
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
#define aFOR(i,x) for (auto i: x)
#define mem(x,i) memset(x,i,sizeof x)
#define fast ios_base::sync_with_stdio(false),cin.tie(0)

int cur = 0;
ll N;
unordered_map <ll,bool> memo,vis;

bool qry(ll a, bool jumping){
	//set cur to a
	
	if (vis[a] && !jumping){
		//cout<<a<<' ';
		return memo[a];
	}
	
	bool res = jump((a - cur + (ll) 10 * N) % N);
	cur = a;
	
	vis[a] = 1;
	memo[a] = res;
	return res;
}

void check(ll x){
	if (!qry(x+1,0)){
		qry(x, 1);
	}else{
		qry(x + N/2, 1);
	}
}

void escape(int n) {
	N = n;
	memo.clear();
	vis.clear();

	if (N == 2){
		jump(1);
		return;
	}
	
	ll l = 0; ll r = N - 1;
	
	bool f = qry(0,0);

	while (l+1 < r){
		
		//cout<<l<<' '<<r<<'\n';
		
		ll mid = (l+r)/2;
	
		if (qry(mid,0) == f){
			l = mid;
			continue;
			if (mid >= N/2) r = mid;
			else l = mid;
		}else{
			r = mid;
			//f = !f;
		}
	}
	
	//cout<<l<<' ';
	
	if (!qry(l,0)){
		if (qry(l+1,0)) l++;
		else l--;
	}

	//cout<<l<<' ';
	check(l);
}

Subtask #1
11.0 / 11.0

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

Subtask #2
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 4 ms 256 KB Output is correct
8 Correct 4 ms 256 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 5 ms 256 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 5 ms 256 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 5 ms 384 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 4 ms 256 KB Output is correct
6 Correct 4 ms 256 KB Output is correct
7 Correct 4 ms 256 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 256 KB Output is correct
10 Correct 4 ms 256 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 4 ms 256 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 4 ms 256 KB Output is correct
19 Correct 5 ms 256 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 5 ms 256 KB Output is correct
22 Correct 5 ms 256 KB Output is correct
23 Correct 5 ms 256 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 4 ms 256 KB Output is correct
26 Correct 5 ms 256 KB Output is correct
27 Correct 5 ms 256 KB Output is correct
28 Correct 4 ms 256 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 4 ms 256 KB Output is correct
31 Correct 4 ms 256 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 4 ms 384 KB Output is correct
35 Correct 5 ms 256 KB Output is correct
36 Correct 4 ms 256 KB Output is correct
37 Correct 4 ms 256 KB Output is correct
38 Correct 5 ms 256 KB Output is correct
39 Correct 5 ms 256 KB Output is correct
40 Correct 5 ms 256 KB Output is correct
41 Correct 5 ms 256 KB Output is correct
42 Correct 5 ms 256 KB Output is correct
43 Correct 5 ms 512 KB Output is correct
44 Correct 5 ms 384 KB Output is correct
45 Correct 5 ms 384 KB Output is correct
46 Correct 5 ms 384 KB Output is correct
47 Correct 4 ms 256 KB Output is correct
48 Correct 5 ms 256 KB Output is correct
49 Correct 5 ms 384 KB Output is correct
50 Correct 4 ms 376 KB Output is correct
51 Correct 5 ms 256 KB Output is correct
52 Correct 5 ms 256 KB Output is correct
53 Correct 5 ms 384 KB Output is correct
54 Correct 5 ms 376 KB Output is correct
55 Correct 5 ms 256 KB Output is correct
56 Correct 5 ms 256 KB Output is correct
57 Correct 5 ms 256 KB Output is correct
58 Correct 5 ms 256 KB Output is correct
59 Correct 5 ms 304 KB Output is correct
60 Correct 5 ms 384 KB Output is correct
61 Correct 5 ms 384 KB Output is correct