# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
228112 | jzh | Lost in the cycle (IOI19_cycle) | C++14 | 5 ms | 512 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"
#include <bits/stdc++.h>
using namespace std;
void escape (int n){
if (n==2){
jump(1);
return;
}
int hi=n-1,lo=1,mid,x=0,y;
bool b,b1;
b1 = jump(0);
while (hi>lo){
mid = lo + (hi-lo)/2 + (hi-lo)%2;
//cout<<mid<<' '<<x;
y = mid-x;
if (y<0)y+=n;
x+=y;//i.e. x = mid
x%=n;
//cout<<' '<<x<<' '<<y<<'\n';
if (jump(y)){
lo = mid;
b = true;
}
else {
hi = mid-1;
b = false;
}
//cout<<"Bool: "<<b<<'\n';
}
//cout<<lo<<' '<<x<<'\n';
y = 0;
if (lo == n-1 && b1)y++;
if (lo!=x){
y += lo-x;
if (y<0)y+=n;
}
y%=n;
if (y!=0)jump(y);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |