# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
729537 | NeroZein | Cave (IOI13_cave) | C++17 | 921 ms | 460 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 N = 5005;
bool vis[N];
void exploreCave(int N_) {
int n;
n = N_;
int a[n];
int d[n];
for (int i = 0; i < n; ++i) {
a[i] = 0;
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
if (!vis[j]) {
a[j] = 0;
}
}
int x = tryCombination(a);
int org = x;
int z = 1;
if (x > i || x == -1) {
z = 0;
}
int l = 0, r = n - 1;
while (l < r) {
int mid = (l + r) >> 1;
for (int j = 0; j <= mid; ++j) {
if (!vis[j]) {
a[j] = z;
}
}
for (int j = mid + 1; j < n; ++j) {
if (!vis[j]) {
a[j] = z ^ 1;
}
}
x = tryCombination(a);
if (x > i || x == -1) {
r = mid;
} else {
l = mid + 1;
}
}
a[l] = z;
d[l] = i;
vis[l] = true;
}
answer(a, d);
}
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... |