This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
#include "cycle.h"
using namespace std;
#define sp << " " <<
#define nl << "\n"
 
void escape(int n){
    if(n==2){
        jump(1);
    }else{
      bool inTrue = jump(n);
      for(int j=n/2; true; j=(j+1)/2){
          bool ok;
          if(inTrue) ok = jump(j);
          else ok = jump(n-j);
  //        cout << j sp inTrue sp ok nl;
          inTrue = ok;
          if(j==1) break;
      }
      if(!inTrue) jump(n-1);
    }
}
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |