| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 342388 | MilosMilutinovic | Cave (IOI13_cave) | C++14 | 19 ms | 512 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/**
* author: milos
* created: 02.01.2021 04:44:44
**/
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
void exploreCave(int n) {
int p[n];
for (int i = 0; i < n; i++) {
p[i] = 0;
}
int x = tryCombination(p);
int ans[n];
if (x == -1) {
for (int i = 0; i < n; i++) {
p[i] = 1;
ans[i] = tryCombination(p);
p[i] = 0;
}
}
answer(p, ans);
}| # | 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... | ||||
