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