제출 #233069

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
233069		Cantfindme	Lost in the cycle (IOI19_cycle)	C++17	100 / 100	6 ms	416 KiB

cycle

#include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int,int> pi;
#define f first
#define s second
#define FAST ios_base::sync_with_stdio(0); cin.tie(0);
#include "cycle.h"

bool test(int x, int jumps, int n) {
	int t = (jumps - x + n) % n;
	//cout << t << "\n";
	return jump(t);
}

void escape(int n) {
	
	if (!jump(0)) {
		ll high = n/2;
		ll low = 0;
		ll cur = 0;
		
		while (high - low > 1) {
			ll mid = (high + low) / 2;
			//cout << low << " " << mid << " " << high << "\n";
			if (test(cur,mid,n) == false) low = mid;
			else high = mid;
			cur = mid;
		}
		
		test(cur,high + n/2,n);	
	} else {
		ll high = n/2+1;
		ll low = 0;
		ll cur = 0;
		
		while (high - low > 1) {
			ll mid = (high + low) / 2;
			//cout << low << " " << mid << " " << high << "\n";
			if (test(cur,mid,n) == true) low = mid;
			else high = mid;
			cur = mid;
		}
		//cout << cur << " " << low << " " << high << "\n";
		test(cur,low,n);
	}
}

• Subtask 1: 11 / 11
• Subtask 2: 33 / 33
• Subtask 3: 56 / 56