# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
99418 | JustasLe | Cave (IOI13_cave) | C++17 | 226 ms | 512 KiB |
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;
const int maxn = (int) 5e3 + 10;
int a[maxn], b[maxn], d[maxn];
void exploreCave(int n) {
for (int i = 0; i < n; i++) {
a[i] = b[i] = d[i] = 0;
}
for (int i = 0; i < n; i++) {
int l = 0, r = n - 1, lst;
int ini = tryCombination(a);
while (l < r) {
int m = (l + r) / 2;
for (int j = l; j <= m; j++) {
if (!d[i]) {
a[j] = !a[j];
}
}
int x = tryCombination(a);
for (int j = l; j <= m; j++) {
if (!d[i]) {
a[j] = !a[j];
}
}
int y = tryCombination(a);
lst = y;
if (x == y && x == i) {
l = m;
} else {
r = m - 1;
}
}
if (ini != lst) {
a[l] = !a[l];
}
d[l] = 1;
b[l] = i;
}
answer(a, b);
}
Compilation message (stderr)
# | 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... |