제출 #235292

#제출 시각아이디문제언어결과실행 시간메모리
235292pere_gil동굴 (IOI13_cave)C++14
0 / 100
274 ms384 KiB
#include <iostream> #include "cave.h" using namespace std; void exploreCave(int N) { int D[N],S[N]; for(int i=0;i<N;i++){ D[i]=i; S[i]=0; } int open=tryCombination(S); while(open<N){ if(S[open]==0){ S[open]=1; } else S[open]=0; open=tryCombination(S); } answer(S,D); }
#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...