# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
443600 | Lam_lai_cuoc_doi | 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.
#define task ""
#include <iostream>
#include <cstdio>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#include "cave.h"
constexpr int N = 5e3 + 5;
int a[N], s[N], d[N];
int m;
int Guess(int l, int r, int v)
{
for (int i = l; i <= r; ++i)
s[i] = v;
int v = tryCombination(s);
return (v == -1 ? n : v);
}
int Get(int l, int r, const int &v, const int &i)
{
while (l != r)
{
if (Guess(l, (l + r) / 2, != v) == i)
r = (l + r) / 2;
else
l = (l + r) / 2 + 1;
}
return l;
}
void exploreCave(int n)
{
m = n - 1;
for (int i = 0; i < n; ++i)
a[i] = i;
for (int i = 0; i < n; ++i)
{
if (Guess(0, a.size(), 1) > i)
{
int tmp = Get(0, m, 1, i);
s[a[tmp]] = 1;
d[a[tmp]] = i;
a[tmp] = a[m];
--m;
}
else
{
int tmp = Get(0, a.size(), 0, i);
s[a[tmp]] = 0;
d[a[tmp]] = i;
a[tmp] = a[m];
--m;
}
}
answer(s, d);
}