| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1357694 | avahw | Cave (IOI13_cave) | C++20 | 9 ms | 496 KiB |
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
void exploreCave(int N) {
int up_down[N];
int ans[N];
for(int i = 0; i < N; i++) ans[i] = i;
for(int i = 0; i < N; i++) up_down[i] = 0;
// assume all door i is controlled by switch i
for(int i = 0; i < N; i++){
int reach = tryCombination(up_down);
if(reach <= i && reach != -1) up_down[i] = 1;
}
answer(up_down, ans);
}
| # | 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... | ||||
