# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
670980 | birthdaycake | 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>
#include "cave.h"
using namespace std;
void exploreCave(int n) {
int vs[n],val[n],sw[n];
memset(vs, 0, sizeof vs);
memset(val, 0, sizeof val);
memset(sw, 0, sizeof sw);
for(int i = 0; i < n; i++){
int comb = 0;
for(int j = 0; j < n; j++){
if(!vs[j]) val[j] = 0;
}
int x = tryCombination(val);
if(x == i) comb = 1;
int l = 0, r = n - 1;
while(l < r){
int mid = (l + r) / 2;
for(int j = l; j <= mid; j++){
if(!vs[j]) val[j] = comb;
}
for(int j = 0; j < mid; j++){
if(!vs[j]) val[j] = !combo;
}
for(int j = mid + 1; j < n; j++){
if(!vs[j]) val[j] = !combo;
}
int x = tryCombination(val);
if(x == i){
r = mid;
}else{
l = mid + 1;
}
}
val[r] = comb;
sw[r] = comb;
vs[r] = 1;
}
answer(val, sw);
}