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"
using namespace std;
void escape(int n) {
if (n == 2)
jump(n);
bool b = jump(n / 2), a = jump(n - n / 2); int x_ = 0;
if (a && b) {
jump(n / 2);
return;
}
int lower, upper;
if (a && !b)
lower = 0, upper = n / 2;
else
lower = n / 2, upper = n;
while (upper - lower > 1) {
int x = (lower + upper) / 2; bool c = jump((x - x_ + n) % n); x_ = x;
if (c)
lower = x;
else
upper = x;
}
jump((lower - x_ + n) % n);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |