# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
991054 | Muhammet | 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"
#include "grader.c"
using namespace std;
void exploreCave(int n) {
int s[n], a[n], b[n], vis[n];
for(int i = 0; i < n; i++) vis[i] = a[i] = b[i] = 0;
for(int i = 0; i < n; i++){
bool tr1 = 0;
int l = 0, r = n-1;
int x = tryCombination(a);
while(l < r){
int md = (l + r) / 2;
for(int j = 0; j < n; j++){
if(vis[j] == 0){
if(j >= l and j <= md) s[j] = 1;
else s[j] = 0;
}
else {
s[j] = a[j];
}
}
int y = tryCombination(s);
bool tr = 0;
if(x == i){
tr1 = 1;
if(y != i){
tr = 1;
}
}
else {
if(y == i){
tr = 1;
}
}
if(tr == 1){
r = md;
}
else {
l = md+1;
}
}
vis[i] = 1;
a[i] = tr1;
b[i] = l;
}
answer(a, b);
return;
}