# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
213414 | rqi | Cave (IOI13_cave) | C++14 | 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"
void exploreCave(int N) {
vi lef;
vi q;
vi D; //door # for switch i
for(int i = 0; i < N; i++){
lef.pb(i);
q.pb(0);
D.pb(0);
}
for(int i = 0; i < N; i++){
//assume q is correct until door i
for(auto u: lef){
q[u] = 0;
}
int cor;
if(tryCombination(q) == i){
//correct for door i is 0
cor = 0;
}
else{
//correct for door i is 1
cor = 1;
}
int l = 0;
int r = sz(lef)-1;
while(l < r){
int mid = (l+r)/2;
//make l-mid cor, mid+1-r 1-cor.
for(int i = 0; i < sz(lef); i++){
if(l <= i && i <= mid){
q[lef[i]] = cor;
}
else{
q[lef[i]] = 1-cor;
}
}
if(tryCombination(q) == i){
l = mid+1;
}
else r = mid;
}
//update lef, q, D
q[lef[l]] = cor;
D[lef[l]] = i;
lef.erase(lef.begin()+l);
}
answer(q, D);
}