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 s[5000], d[5000];
for (int i = 0; i < N; i++) {
s[i] = 0;
d[i] = -1;
}
for (int i = 0; i < N; i++) {
vector<int> v;
for (int j = 0; j < N; j++) {
if (d[j] == -1) {
v.push_back(j);
}
}
int t = tryCombination(s);
int ok = 0, ng = v.size();
while (ng - ok > 1) {
int mid = (ok + ng) / 2;
for (int j = 0; j <= mid; j++) {
s[v[j]] ^= 1;
}
int r = tryCombination(s);
if (t == i) {
if (r == i) {
ok = mid;
} else {
ng = mid;
}
} else {
if (r == i) {
ng = mid;
} else {
ok = mid;
}
}
for (int j = 0; j <= mid; j++) {
s[v[j]] ^= 1;
}
}
d[v[ng]] = i;
if (t == i) {
s[v[ng]] ^= 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... |