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"
void exploreCave(int N) {
int pos[N], ans[N], k, i;
for(i=0; i<N; i++){
k=tryCombination(ans);
if(k==-1){
ans[i]=1;
pos[i]=tryCombination(ans);
ans[i]=0;
continue ;
}
ans[i+1]=1;
if(k==tryCombination(ans)){
pos[i]=k;
}
else{
ans[i]=1;
pos[i]=tryCombination(ans);
ans[i]=0;
}
ans[i+1]=0;
}
answer(ans, 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... |