# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
342386 | 2021-01-02T04:02:25 Z | MilosMilutinovic | Cave (IOI13_cave) | C++14 | 0 ms | 0 KB |
/** * author: milos * created: 02.01.2021 04:44:44 **/ #include "dream.h" #include <bits/stdc++.h> using namespace std; void exploreCave(int n) { vector<int> p; for (int i = 0; i < n; i++) { p.push_back(0); } int x = tryCombination(p); vector<int> ans; if (x == -1) { for (int i = 0; i < n; i++) { p[i] = 1; ans.push_back(tryCombination(p)); p[i] = 0; } } answer(p, ans); }