| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 988327 | Muaath_5 | Cave (IOI13_cave) | C++17 | 0 ms | 0 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.
int n;
#ifndef MUAATH_5
#include "grader.h"
#endif
int tryCombination(int c[]);
void answer(int s[], int d[]);
void exploreCave(int n_) {
n = n_;
int correct[n] = {};
int index[n] = {};
for (int i = 0; i < n; i++) {
int zero = (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 (!zero)
for (int i = 0; i <= mid; i++)
cpy[i] = 1;
if (tryCombination(cpy) == i)
l = mid+1;
else
r = mid;
}
index[i] = l;
correct[i] = !zero;
}
answer(index, correct);
}