| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1231564 | islam_2010 | Cave (IOI13_cave) | C++20 | 8 ms | 512 KiB |
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
int tryCombination(int s[]);
void exploreCave(int n){
int d[n+1], s[n+1];
for(int i = 0; i <= n; i++){
s[i] = 0;
}for(int i = 0; i < n; i++){
s[i] = 1;
int k = tryCombination(s);
d[i] = k;
s[i] = 0;
}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... | ||||
