# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1177416 | tegshzaya | 동굴 (IOI13_cave) | C++20 | 6 ms | 328 KiB |
#include "cave.h"
void exploreCave(int N) {
int a[N+5],b[N+5];
for (int i=0; i<N; i++)
{a[i]=0;
a[i]=1;
int x=tryCombination(a);
b[i]=x;
a[i]=0;
}
answer(a,b);
}
# | 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... |