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 "cave.h"
#include <bits/stdc++.h>
using namespace std;
void
exploreCave (int n)
{
// subtask 1
vector < int > a (n), b (n);
for (int i = tryCombination (a.data ()); i != -1; i = tryCombination (a.data ()))
a[i] = !a[i];
for (int i = 0; i < n; ++i) b[i] = i;
answer (a.data (), b.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... |