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;
#define ask(x) tryCombination(x)
void exploreCave(int n) {
int S[n], D[n], a[n];
bool flag[n]; fill(flag, flag + n, false);
fill(a, a + n, 0); // query with a, answer with S
for (int i = 0; i < n; i++) {
int prev = ask(a);
if (prev == i) S[i] = 1;
else S[i] = 0;
int l = 0, r = n;
while (l <= r) {
if (l == r) {
flag[l] = true; D[i] = l; break;
}
int m = (l + r) >> 1;
for (int i = l; i < r; i++) if (!flag[i]) a[i] = 1;
prev = ask(a);
for (int i = m; i < r; i++) if (!flag[i]) a[i] = 0;
if (prev == i) r = m - 1;
else l = m + 1;
}
}
answer(S, 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... |