| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1243638 | lacito | Cave (IOI13_cave) | C++17 | 6 ms | 328 KiB |
#include "cave.h"
void exploreCave(int n) {
int s[n], d[n];
for (int i = 0; i < n; i++) {
s[i] = 0;
d[i] = i;
}
int closed = tryCombination(s);
while (closed != -1) {
s[closed] = 1;
closed = tryCombination(s);
}
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... | ||||
