# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
339103 | markussie | 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.
#include "cave.h"
#include <vector>
#include <algorithm>
using namespace std;
void exploreCave(int n)
{
vector<int> to(n, -1);
vector<int> pos(n, -1);
for(int i = 0; i < n; ++i)
{
vector<int> attemp(n, 0);
for(int j = 0; j < n; ++j)
if(pos[j] != -1)
attemp[j] = pos[j];
int type = tryCombination(attemp.data()) == i;
int l = 0, r = n;
while(r - l > 1)
{
int mid = (l + r) / 2;
for(int j = l; j < r; ++j)
if(pos[j] != -1)
attemp[j] = pos[j];
else
attemp[j] = type ^ (j >= mid);
opened = tryCombination(attemp.data());
if(opened == i)
l = mid;
else
r = mid;
}
pos[l] = type;
to[l] = i;
}
answer(pos.data(), to.data());
}