Submission #371949

#	Time	Username	Problem	Language	Result	Execution time	Memory
371949		shrek12357	Lost in the cycle (IOI19_cycle)	C++14	0 / 100	1 ms	364 KiB

cycle

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <fstream>
#include <queue>
#include <stack>
#include <iomanip>
#include <assert.h>
#include <bitset>
#include "cycle.h"
using namespace std;
#define ll long long
//cin.tie(0);ios_base::sync_with_stdio(0);

void solve(int n) {
	int lo = 0, hi = n / 2;
	int cur = 0;
	while (lo < hi) {
		int mid = (lo + hi) / 2;
		cur = mid;
		bool valid;
		if (mid > cur) {
			valid = jump(mid - cur);
		}
		else {
			valid = jump(n - (cur - mid));
		}
		if (valid) {
			hi = mid;
		}
		else {
			lo = mid + 1;
		}
	}
	jump(lo - cur);
	jump(n / 2);
	return;
}

void escape(int n) {
	bool found = jump(0);
	if (found == false) {
		solve(n);
	}
	else {
		if (jump(n / 2)) {
			if (jump(1)) {
				jump(n - 1);
				jump(n / 2);
				return;
			}
			else {
				jump(0);
				return;
			}
		}
		else {
			solve(n);
		}
	}
}

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