제출 #1243638

#제출 시각아이디문제언어결과실행 시간메모리
1243638lacito동굴 (IOI13_cave)C++17
12 / 100
6 ms328 KiB
#include "cave.h"

void exploreCave(int n) {
    int s[n], d[n];
    for (int i = 0; i < n; i++) {
        s[i] = 0;
        d[i] = i;
    }
    int closed = tryCombination(s);
    while (closed != -1) {
        s[closed] = 1;
        closed = 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...