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) {
/*int a[] = {1, 1, 1, 0};
int b[] = {3, 1, 0, 2};
answer(a, b);*/
int a[n], b[n];
for(int i = 0; i < n; i++) {
a[i] = 0;
b[i] = i;
}
for(int i = tryCombination(a); i < n; i++) {
a[i] = 1 - a[i];
i = tryCombination(a);
}
answer(a, b);
}
# | 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... |