| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1263400 | aren_dance | Cave (IOI13_cave) | C++20 | 1 ms | 324 KiB |
#include <iostream>
#include <vector>
#include "cave.h"
using namespace std;
void exploreCave(int N) {
int p1[N];
int p2[N];
for (int i = 0;i < N;++i) {
p1[i]=i;
p2[i] = i;
}
tryCombination(p1);
answer(p2,p1);
}| # | 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... | ||||
