# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
813296 | Pikachu | 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 <bits/stdc++.h>
using namespace std;
template<typename T>
inline bool maxi(T &x, const T &val)
{
if (x < val) return x = val, true;
return false;
}
template<typename T>
inline bool mini(T &x, const T &val)
{
if (x > val) return x = val, true;
return false;
}
int tryCombination(int S[]);
void answer(int S[], int D[]);
const int maxn = 5010;
int n;
int S[maxn], D[maxn];
bool done[maxn];
void reverse(int l = 0, int r = n - 1)
{
for (int i = l; i <= r; i++) {
if (!done[i]) S[i] = !S[i];
}
}
void exploreCave(int n)
{
::n = n;
for (int i = 0; i < n; i++) {
if (tryCombination(S) == i) reverse();
int l = 0;
int r = n - 1;
while (l < r) {
int mid = (l + r) >> 1;
reverse(l, mid);
if (tryCombination(S) == i) {
r = mid;
}
else l = mid + 1;
reverse(l, mid);
}
done[l] = true;
D[l] = i;
}
answer(S, D);
}