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 a[n],b[n];
for(int i = 0; i < n; i++){
a[i] = -1;
b[i] = -1;
}
for(int i = 0; i < n; i++){
int num = 0;
for(int j = 0; j < n; j++){
if(b[j] == -1) a[i] = 0;
}
int ask = tryCombination(a);
if(ask <= i) num = 1;
int l = 1,r=n-i;
int idx = -1;
while(l <= r){
int m = (l+r)/2;
int cnt = 0;
for(int j = 0; j < n; j++){
if(cnt >= m){
if(b[j] == -1){
a[j] = 1-num;
}
}else{
if(b[j] == -1){
a[j] = num;
idx = j;
cnt++;
}
}
}
ask = tryCombination(a);
if(ask <= i) l = m+1;
else{r = m-1;}
}
a[idx] = num;
b[idx] = i;
}
answer(a,b);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |