제출 #813174

#제출 시각아이디문제언어결과실행 시간메모리
813174Kerim동굴 (IOI13_cave)C++17
12 / 100
8 ms400 KiB
#include "cave.h" void exploreCave(int n) { int a[n], b[n]; for (int i = 0; i < n; i++) a[i] = 0, b[i] = i; do{ int res = tryCombination(a); if (res == -1) break; a[res] = 1; }while(1); answer(a, b); }
#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...