# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
838386 | beaboss | 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 "cycle.h"
void escape(int n) {
bool works = jump(0);
while (!works) jump(n/2);
int lo = 0;
int hi = n/2;
int cur_dist = 0;
while (lo < hi) {
int m = (lo + hi)/2;
if (jmp((m - cur_dist + n) % n)) {
lo = m;
} else hi = m-1;
cur_dist = m;
}
jump((lo - cur_dist + n) % n);
}