제출 #307943

#제출 시각아이디문제언어결과실행 시간메모리
307943sean9892Lost in the cycle (IOI19_cycle)C++14
0 / 100
0 ms256 KiB
#include "cycle.h"

int distance(int pos,int tar,int n){
	return (tar-pos+n)%n;
}

void escape(int n) {
	int pos=0;
	int N;
	N=n/2*2;
	int l=0,r=N;
	while(l<r){
		int m=l+r>>1;
		bool x=jump(distance(pos,m,n));
		pos=m;
		if(x){
			l=m;
		}
		else{
			r=m;
		}
		if(r-l<=2){
			break;
		}
	}
	for(int i=r-1;i>=l;i--){
		bool x=jump(distance(pos,i,n));
		pos=i;
		if(x){
			return;
		}
	}
	if(n&1)jump(distance(pos,N,n));
}

컴파일 시 표준 에러 (stderr) 메시지

cycle.cpp: In function 'void escape(int)':
cycle.cpp:13:10: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   13 |   int m=l+r>>1;
      |         ~^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...