# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
580707 | 2022-06-21T17:09:59 Z | Omar_Elgedawy | Lost in the cycle (IOI19_cycle) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> //#include "grader.cpp" using namespace std; void escape(int n) { if(jump(0)){ int loc=0,one=0; int l=n/2,r=n-1; int lst=0; 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; // cout<<l<<' '<<r<<' '<<m<<' '<<dist<<' '<<loc<<endl; if(jump(dist)){ r=m-1; one=loc; lst=0; } else{ lst=n-loc+1; l=m+1; } } // cout<<loc<<' '<<one; if(loc<one) jump(one-loc); else if(loc>one) jump((n-loc)+one); jump(n/2); } else{ int loc=0,one; int l=1,r=n/2+1; int lst=0; 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; // cout<<l<<' '<<r<<' '<<m<<' '<<dist<<' '<<loc<<endl; if(jump(dist)){ r=m-1; one=loc; lst=0; } else{ lst=n-loc+1; l=m+1; } } // cout<<loc<<' '<<one; if(loc<one) jump(one-loc); else if(loc>one) jump((n-loc)+one); jump(n/2); } }