#include "cave.h"
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
const int N = 5e3+5;
int n;
int fix[N];
int ind,ans[N],p[N],cnt[N];
void exploreCave(int N) {
n = N;
int v[n];
for (int i = 0; i < n; i++) {
v[i] = 1;
}
int c = tryCombination(v);
for (int i = 0; i < n; i++) {
int l = 0; int r = n-1;
while (l <= r) {
int mid = (l+r)/2;
for (int j = l; j <= mid; j++) {
if (fix[j]) continue;
v[j] = !v[j];
cnt[j]++;
}
int nc = tryCombination(v);
if (c != nc) {
ind = mid;
r = mid;
} else {
ind = mid;
l = mid;
}
c = nc;
}
ans[i] = ind;
fix[ind] = 1;
if (cnt[ind]%2) {
p[ind]=!v[ind];
}
if (c != -1 && c <= ind) {
p[ind]=!p[ind];
v[ind]=!v[ind];
}
}
int S[N],D[N];
for (int i = 0; i < n; i++) {
S[i] = v[i];
D[ans[i]] = i;
}
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... |