# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
569855 | Aurora2005 | Lost in the cycle (IOI19_cycle) | C++14 | 0 ms | 0 KiB |
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<bits/stdc++.h>
#include"cycle.h"
using namespace std;
void escape(long long int n){
long long int l=0,r=N;
while(r-l != 1 && (l != N-1 || r != 0)){
long long int L = l;
long long int R = r;
if(L > R) R += N;
long long int M = (L+R)/2;
long long int d = N-N/2-M;
if(d < 0) d += N;
if(jump(d)){
l = M;
}
else{
r = M;
}
}
jump(N-l);
}