# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
976238 | HappyCapybara | Lost in the cycle (IOI19_cycle) | C++17 | 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>
using namespace std;
void escape(int n){
int l=0, r=n;
int cur = 0;
while (l < r-1){
int m = (l+r)/2;
if (jump((m-cur+n)%n)) l = m;
else r = m;
}
jump((l-cur)%n);
return;
}