제출 #520991

#제출 시각아이디문제언어결과실행 시간메모리
520991FulopMate동굴 (IOI13_cave)C++17
12 / 100
17 ms412 KiB
#include "cave.h" void exploreCave(int N) { int S[5000] = {}; for(int i = 0; i < N; i++){ if(tryCombination(S) == i){ S[i] = 1; } } int D[5000]; for(int i = 0; i < N; i++){ D[i] = i; } 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...