# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1091004 | AndreasK | Cave (IOI13_cave) | C++14 | 0 ms | 0 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.
#include <bits/stdc++.h>
#include "cave.h"
using namespace std;
void exploreCave(int N) {
vector <int> A(N, 0);
vector <int> B(N);
for (int c = 0; c < N; c++)
A[c] = c + 1;
int x = tryCombination(A);
while (x != -1) {
A[x - 1] = 1;
x = tryCombination(A);
}
answer(A, B);
}