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