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>
#include <algorithm>
#include <cstring>
void exploreCave(int N) {
int a[N];
memset(a, 0, sizeof a);
int p = tryCombination(a);
while(p != -1){
a[p] = !a[p];
p = tryCombination(a);
}
int b[N];
for(int i=0; i<N; ++i){
b[i] = 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... |