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"
#define N 5000
void exploreCave(int n) {
static int cc[N], ii[N];
static char used[N];
int i, j;
for (i = 0; i < n; i++) {
int c, h, j_;
for (j = 0; j < n; j++)
if (!used[j])
cc[j] = 0;
c = tryCombination(cc) == i, j_ = 0;
for (h = 0; h < 13; h++) {
for (j = 0; j < n; j++)
if (!used[j])
cc[j] = (j & 1 << h) == 0 ? c : c ^ 1;
if (tryCombination(cc) == i)
j_ |= 1 << h;
}
used[j_] = 1, cc[j_] = c, ii[j_] = i;
}
answer(cc, ii);
}
# | 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... |