# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1105668 | jadai007 | 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<bits/stdc++.h>
using namespace std;
void exploreCave(int N) {
int swi[N] = {0}, door[N] = {0}, tmp[N] = {0}, state[N] = {0};
for(int i = 0; i < N; ++i){
int l = 0, r = N - 1;
int ck = tryCombination(swi);
int open = (ck == -1 || ck > i);
while(l < r){
int mid = (l + r) >> 1;
tmp = swi;
for(int j = l; j <= mid; ++j) if(!state[i]) tmp[i]^=1;
if(open){
if(tryCombination(tmp) == i) r = mid;
else l = mid + 1;
}
else{
int ck = tryCombination(tmp);
if(ck > i || ck == -1) r = mid;
else l = mid + 1;
}
}
door[r] = i;
state[r] = 1;
if(!can) swi[r]^=1;
}
answer(swi, door);
}