# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
154821 | Nightlight | 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>
bool found[70005], ketemu;
bool ANS[70005];
int binser1(){
int l = 0, r = N-1, res = -1;
while(l <= r){
int mid = (l+r)/2;
int tmp[N];
for(int i = 0; i < N; i++)tmp[i] = (l <= i && mid >= i) ? 1 : 0;
if(tryCombination(tmp[]) > ketemu){
r = mid+1;
ans = mid;
}else = mid;
}
return res;
}
int binser2(){
int l = 0, r = N-1, res = -1;
while(l <= r){
int mid = (l+r)/2;
int tmp[N];
for(int i = 0; i < N; i++)tmp[i] = (l <= i && mid >= i) ? 0 : 1;
if(tryCombination(tmp[]) > ketemu){
r = mid+1;
ans = mid;
}else = mid;
}
return res;
}
void exploreCave(int N) {
bool Switch[N];
int door[N];
for(ketemu = 0; ketemu < N; ketemu++){
int res = binser1();
if(res != -1){
door[ketemu] = res;
ANS[res] = 1;
found[res] = 1;
Switch[res] = 1;
continue;
}
res = binser2();
door[ketemu] = res;
Switch[res] = 1;
found[res] = 1;
}
answer(int Switch[], int door[]);
}