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;
void exploreCave(int N) {
int n = N;
int confirmed[n];
int test[n];
int correspondence[n];
for (int i = 0; i < n; i++)
test[i] = 0;
ios_base::sync_with_stdio(false);
cin.tie(NULL);
for(int to_try = 0; to_try<n; to_try++) {
int l = 0; int r = n-1;
int certo = 0;
for (int i = 0; i<r; i++) {
if (confirmed[i] != -1) test[i] = confirmed[i];
else test[i] = 1;
}
if (tryCombination(test) != to_try) certo = 1;
while (l != r) {
int mid = (l+r) / 2;
for (int i = 0; i<r; i++) {
if (confirmed[i] != -1) test[i] = confirmed[i];
else {
if (i < l) test[i] = !certo;
else if (i < mid + l) test[i] = certo;
else test[i] = !certo;
}
}
int tried = tryCombination(test);
if (to_try != tried) {
r = mid - 1;
} else {
l = mid;
}
}
confirmed[l] = certo;
correspondence[l] = to_try;
}
answer(confirmed, correspondence);
}
# | 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... |