| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1216683 | giorgi123glm | Cave (IOI13_cave) | C++20 | 9 ms | 520 KiB |
#include "cave.h"
#include <iostream>
#include <mutex>
#include <vector>
using namespace std;
void exploreCave(int N) {
vector <int> comb (N);
for (int i = 0; i < N; i++) {
vector <int> giv (N);
giv[i] = 1;
int get = tryCombination (giv.data());
comb[i] = get;
}
answer ((vector <int> (N, 0)).data(), comb.data());
}
| # | 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... | ||||
