# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
374988 | Alex_tz307 | 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;
const int NMAX = 8192;
int states[NMAX], doors[NMAX], query_states[NMAX];
bool found[NMAX];
bool opens(int ans, int door) {
if(ans == -1)
return true;
return ans > door;
}
void exploreCave(int N) {
assert(N == n);
for(int i = 0; i < N; ++i) {
bool colour = true;
for(int j = 0; j < N; ++j)
if(found[j])
query_states[j] = states[j];
else
query_states[j] = 0;
int ans = tryCombination(query_states);
if(opens(ans, i))
colour = false;
int st = 0, dr = N - 1;
while(st < dr) {
int mid = (st + dr) >> 1;
for(int j = 0; j < N; ++j)
if(found[j])
query_states[j] = states[j];
else
if(st <= j && j <= mid)
query_states[j] = colour;
else
query_states[j] = colour ^ 1;
int ans = tryCombination(query_states);
if(opens(ans, i))
dr = mid;
else
st = mid + 1;
}
found[st] = true, states[st] = colour, doors[st] = i;
}
answer(states, doors);
}