제출 #166692

#제출 시각아이디문제언어결과실행 시간메모리
166692sams동굴 (IOI13_cave)C++14
13 / 100
27 ms512 KiB
#include "cave.h" void exploreCave(int N) { int S[N+1]; int D[N+1]; for(int i = 0 ; i < N ; ++i) S[i] = D[i] = 0; for(int i = 0 ; i < N ; ++i) { S[i] = 1; int s = tryCombination(S); //printf("%d\n", s); D[i] = s; S[i] = 0; } 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...