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(int N){
int l=0,r=N,p=0;
while(r-l != 1 && (l != N-1 || r != 0)){
int L = l;
int R = r;
if(L > R) R += N;
int M = (L+R)/2;
int d = N-N/2-M;
if(d < 0) d += N;
p += d;
p %= N;
if(jump(d)){
l = M;
}
else{
r = M;
}
}
int now = l+p;
now %= N;
jump(N-now);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |