# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
336893 | blue | Cave (IOI13_cave) | C++11 | 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 <iostream>
#include <vector>
using namespace std;
int S[N], D[N], Q[N];
//switch_state, switch_door, query
void b_search(int door, int pos, int a, int b)
{
if(a == b)
{
D[a] = door;
S[a] = pos;
}
else
{
m = (a+b)/2;
for(int i = 0; i < N; i++)
{
if(S[i] != -1) Q[i] = S[i];
else
{
if(a <= i && i <= m) Q[i] = pos;
else Q[i] = !pos;
}
}
int q = tryCombination(Q);
if(q == door) b_search(door, pos, m+1, b);
else b_search(door, pos, a, m);
}
}
void exploreCave(int N)
{
for(int i = 0; i < N; i++) S[i] = D[i] = -1;
for(int door = 0; door < N; door++)
{
for(int i = 0; i < N; i++)
{
if(S[i] == -1) Q[i] = 0;
else Q[i] = S[i];
}
int q = tryCombination(Q);
if(q == door)
{
//switch_pos of switch connected to door 1 = 1
b_search(door, 1, 0, N-1);
}
else
{
b_search(door, 0, 0, N-1);
}
}
answer(S, D);
}