| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1303463 | the_commando_x | 동굴 (IOI13_cave) | C++17 | 8 ms | 348 KiB |
#include "cave.h"
void exploreCave(int N)
{
int S[5000];
int D[5000];
for (int i = 0; i < N; ++i)
{
S[i] = 1;
int door = tryCombination(S);
D[i] = door;
S[i] = 0;
}
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... | ||||
