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 <queue>
void exploreCave(int N) {
int d[N];
int s[N];
for(int i=0; i<N; i++){s[i]=0;}
while(tryCombination(s)!=-1){
int a= tryCombination(s);
for(int i=0; i<N; i++){
s[i]++; s[i]%=2;
if(tryCombination(s)==-1||tryCombination(s)>a){break;}
s[i]++; s[i]%=2;
}
}
for(int i=0; i<N; i++){
s[i]+=1; s[i]%=2;
int a= tryCombination(s);
d[i]=a;
s[i]+=1; s[i]%=2;
}
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... |