# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
992841 | Muaath_5 | Cave (IOI13_cave) | C++17 | 2044 ms | 348 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"
void exploreCave(int n) {
int sure[n] = {}, correct[n] = {}, index[n] = {};
for (int i = 0; i < n; i++) {
int open = tryCombination(correct) == i;
int l = 0, r = n-1;
while (l < r) {
const int mid = (l+r)/2;
int cpy[n];
for (int i = 0; i < n; i++)
cpy[i] = correct[i];
if (!open)
for (int i = mid+1; i < n; i++)
if (!sure[i])
cpy[i] = 1;
else
for (int i = 0; i <= mid; i++)
if (!sure[i])
cpy[i] = 1;
if (tryCombination(cpy) == i)
l = mid+1;
else
r = mid;
}
index[l] = i, correct[l] = open, sure[l] = 1;
}
answer(correct, index);
}
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... |