| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1358357 | avahw | Cave (IOI13_cave) | C++20 | 5 ms | 516 KiB |
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
void exploreCave(int N) {
int up_down[N];
int which_door[N];
for(int i = 0; i < N; i++) which_door[i] = -1;
for(int i = 0; i < N; i++) up_down[i] = 0;
for(int i = 0; i < N; i++){
int test[N];
for(int j = 0; j < N; j++) test[j] = 0;
test[i] = 1;
which_door[i] = tryCombination(test);
}
answer(up_down, which_door);
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
