# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
580754 | Omar_Elgedawy | 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 <bits/stdc++.h>
#include "grader.cpp"
using namespace std;#include <bits/stdc++.h>
// #include "grader.cpp"
#include "cycle.h"
using namespace std;
void escape(int n) {
if(jump(0)){
if(jump(n/2+n%2)){
return;
}
jump(n/2+n%2);
int loc=0,one=0;
int l=n/2,r=n-1;
while(l<=r){
int m=(r+l)/2;
int dist;
if(m>loc)
dist=m-loc;
else
dist=((n-loc)+m)%n;
loc=(loc+dist)%n;
if(jump(dist)){
r=m-1;
one=loc;
}
else{
l=m+1;
}
}
if(loc<one){
loc=(loc+(one-loc))%n;
jump(one-loc);
}
else if(loc>one){
loc=(loc+(n-loc)+one)%n;
jump(((n-loc)+one)%n);
}
jump(n/2);
}
else{
int loc=0,one;
int l=1,r=n/2+1;
while(l<=r){
int m=(r+l)/2;
int dist;
if(m>loc)
dist=m-loc;
else
dist=(n-loc)+m;
loc=(loc+dist)%n;
if(jump(dist)){
r=m-1;
one=loc;
}
else{
l=m+1;
}
}
if(loc<one)
jump(one-loc);
else if(loc>one)
jump((n-loc)+one);
jump(n/2);
}
}
void escape(int n) {
if(jump(0)){
if(jump(n/2+n%2)){
return;
}
jump(n/2+n%2);
int loc=0,one=0;
int l=n/2,r=n-1;
while(l<=r){
int m=(r+l)/2;
int dist;
if(m>loc)
dist=m-loc;
else
dist=((n-loc)+m)%n;
loc=(loc+dist)%n;
if(jump(dist)){
r=m-1;
one=loc;
}
else{
l=m+1;
}
}
if(loc<one){
loc=(loc+(one-loc))%n;
jump(one-loc);
}
else if(loc>one){
loc=(loc+(n-loc)+one)%n;
jump(((n-loc)+one)%n);
}
jump(n/2);
}
else{
int loc=0,one;
int l=1,r=n/2+1;
while(l<=r){
int m=(r+l)/2;
int dist;
if(m>loc)
dist=m-loc;
else
dist=(n-loc)+m;
loc=(loc+dist)%n;
if(jump(dist)){
r=m-1;
one=loc;
}
else{
l=m+1;
}
}
if(loc<one)
jump(one-loc);
else if(loc>one)
jump((n-loc)+one);
jump(n/2);
}
}