제출 #1303462

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