# | 제출 시각UTC-0 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1142393 | orzdraiduwu | 동굴 (IOI13_cave) | C++20 | 6 ms | 324 KiB |
#include "cave.h"
#include <cstring>
void exploreCave(int n) {
int s[n]; memset(s, 0, sizeof s);
int d[n]; memset(d, 0, sizeof d);
for(int i = 0 ; i < n ; i++) {
d[i] = i;
int k = tryCombination(s);
if(i+1 > k) s[i] = !s[i];
}
answer(s, d);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |