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;
bool query(int S[], int P) {
return tryCombination(S) == P;
}
void exploreCave(int N) {
int res[N], s[N], d[N];
memset(res,-1,sizeof(res));
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
s[j] = (res[j] != -1 ? res[j] : 0);
}
int cur = (tryCombination(s) == i);
int p = -1;
for (int l = 0, r = N-1; l <= r; ) {
int mid = (l+r)/2;
for (int j = 0; j < N; j++) {
if (res[j] != -1) s[j] = res[j];
if (l <= i && i <= mid) s[j] = cur;
else s[j] = cur^1;
}
if (tryCombination(s) != i) {
p = mid;
r = mid-1;
}
else l = mid+1;
}
res[p] = cur;
d[p] = i;
}
answer(res,d);
}
# | 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... |