This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "cycle.h"
#include "bits/stdc++.h"
using namespace std;
void escape(int n) {
    if(n == 2) {
        jump(1);
        return;
    }
    else if(n == 3) {
        if(!jump(2)) jump(2);
        return;
    }
	int l = 1, r = n - 1;
    int cut = (n + 1) / 2;
    while(l < r) {
        int m = (l + r + 1) / 2;
        int mm = m % n;
        cerr << l << ' ' << r << '\n';
        cerr << mm << ' ';
        int walk = (cut + n - mm) % n;
        cerr << walk << '\n';
        if(jump(walk)) {
            l = m;
            cerr << "a\n";
        }
        else {
            r = m - 1;
        }
        l += walk;
        r += walk;
    }
    cerr << l << " now\n";
    l %= n;
    jump(n - l);
    return;
}
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |