| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1314554 | Agageldi | 동굴 (IOI13_cave) | C++20 | 7 ms | 332 KiB |
#include "bits/stdc++.h"
// #include "grader.c"
#include "cave.h"
#define MAXN 500005
int a[MAXN], n, b[MAXN];
void exploreCave(int N) {
n = N;
for(int i = 0; i < n; i++) {
b[i] = i;
a[i] = 0;
}
for(int i = 0;i < n; i++) {
a[i] = 1;
int tr = tryCombination(a);
b[i] = tr;
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... | ||||
