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<iostream>
void exploreCave(int n){
int k=14;
while((1<<k)>=n)k--;
k++;
int w[k+1][n];
for(int j=0; j<k; j++){
for(int i=0; i<n; i++)w[j][i]=!!((1<<j)&i);
}
for(int i=0; i<n; i++)w[k][i]=1;
int pos[n];
for(int i=0; i<n; i++){
int id=0;
for(int j=0; j<k; j++){
int l=tryCombination(w[j]);
//std::cerr<<l;
if(l==-1)l=n;
if(l>i)id+=(1<<j);
}
int l=tryCombination(w[k]);
if(l==-1)l=n;
bool b=1;
if(l<=i){
id=((1<<k)-1)^id;
b=0;
}
pos[id]=i;
for(int j=0; j<=k; j++)w[j][id]=b;
}
answer(w[0], pos);
}
# | 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... |