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"
using namespace std;
int n2;
int ask(int x[]){
int ts=tryCombination(x);
if(ts==-1)return n2;
return ts;
}
void exploreCave(int N) {
n2=N;
int d[N]={},s[N]={};
bool dn[N]={};
if(N==1){
if(ask(s)!=1)s[0]=1;
answer(s,d);
return;
}
int ts=ask(s),ts2;
for(int i=0; i<N; i++){
int l=0,r=N-1;
while(l<=r){
if(l==r){
dn[l]=1;
d[l]=i;
if(ts2<=i)s[l]^=1;
ts=ask(s);
break;
}
int md=(l+r)/2;
for(int j=l; j<=md; j++){
if(dn[j])continue;
s[j]^=1;
}
ts2=ask(s);
if((ts<=i && ts2>=i+1) || (ts>=i+1 && ts2<=i)){
r=md;
ts=ts2;
}
else{
l=md+1;
}
}
}
answer(s,d);
}
# | 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... |