#include <bits/stdc++.h> #include "cycle.h" using namespace std; void escape(int n){ // binary search on the first green (turning point) int l = 0, r = n; int pr = 0; while(l < r - 1) { int m = (l + r) / 2; if (jump((m - pr + n) % n)) l = m; else r = m; pr = m; } jump((pr + n/2) % n); return ; }