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>
int ans[5000], w[5000], q[5000];
void exploreCave(int N) {
for (int i = 0; i < N; i++) {
memset(q,0,5000*sizeof(int));
for (int j = 0; j < i; j++) q[ans[j]]=w[j];
w[i]=(tryCombination(q)==i);
for (int b = 1; b < N; b<<=1) {
memset(q,0,5000*sizeof(int));
for (int k = 0; k < N; k++) {
q[k]=1 ^ w[i] ^ bool(k & b);
}
for (int j = 0; j < i; j++) q[ans[j]]=w[j];
if (tryCombination(q)!=i) ans[i] |= b;
}
}
for (int i = 0; i < N; i++) q[ans[i]]=w[i];
for (int i = 0; i < N; i++) w[ans[i]]=i;
answer(q,w);
}
# | 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... |