제출 #733635

#제출 시각아이디문제언어결과실행 시간메모리
733635khangrl동굴 (IOI13_cave)C++14
0 / 100
24 ms372 KiB
#include "cave.h"

void exploreCave(int N) {
	int pos[N], ans[N], k, i;
	for(i=0; i<N; i++){
		k=tryCombination(ans);
		if(k==-1){
			ans[i]=1;
			pos[i]=tryCombination(ans);
			ans[i]=0;
			continue ;
		}
		/*ans[i+1]=1;
		if(k==tryCombination(ans)){
			pos[i]=k;
		}
		else{
			ans[i]=1;
			pos[i]=tryCombination(ans);
			ans[i]=0;
		}
		ans[i+1]=0;*/
	}
	answer(ans, pos);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...