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) {
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) / 2;
int mm = m % n;
int walk = (cut + n - mm) % n;
if(jump(walk)) {
r = m;
}
else l = m + 1;
l += walk;
r += walk;
}
l %= n;
jump((cut + n - l) % n);
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... |