| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1310678 | ninogogatishvili | Cave (IOI13_cave) | C++20 | 0 ms | 0 KiB |
void exploreCave(int N) {
int S[N];
int D[N];
for (int i = 0; i < N; i++) {
S[i] = 0;
}
int closedDoor = tryCombination(S);
if (closedDoor != -1) {
for (int i = 0; i < N; i++) {
S[i] = 1;
closedDoor = tryCombination(S);
if (closedDoor != -1) {
D[i] = closedDoor;
}
}
}
for (int i = 0; i < N; i++) {
S[i] = 1;
}
answer(S, D);
}
