# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
441139 | lLab_ | 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"
#include <bits/stdc++.h>
using namespace std;
void exploreCave(int N) {
n = N;
int B[N], door[N];
for(int i=0;i<N;++i){
B[i] = 0;
door[i] = -1;
}
int res = 0;
while(res != -1){
res = tryCombination(B);
if(res == -1) break;
for(int i=0;i<N;++i){
if(door[i] != -1) continue;
B[i] = (B[i]+1)%2;
int res2 = tryCombination(B);
B[i] = (B[i]+1)%2;
if(res2 < res){
door[i] = res2;
}else if(res2 > res){
door[i] = res;
break;
}
}
}
for(int i=0;i<N;++i){
B[i] = (B[i]+1)%2;
door[i] = tryCombination(B);
B[i] = (B[i]+1)%2;
}
answer(B,door);
}