| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1298424 | alexiah | Cave (IOI13_cave) | C++20 | 15 ms | 512 KiB |
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
void exploreCave(int n) {
int ans [n]; int doors[n]; int conex[n];
for(int i = 0; i < n; i++) conex[i] = i;
for(int i = 0; i < n; i++) doors[i] = 0;
for(int i = 0; i < n; i++){
int act = tryCombination(doors);
if(act == i) doors[i] = 1;
else continue;
}
answer(ans , conex);
}
| # | 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... | ||||
