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 combination[N] = {0};
int curHighest = -1;
while (true) {
curHighest = tryCombination(combination);
if (curHighest == -1) {
break;
} else {
combination[curHighest] = 1;
}
}
int switches[N] = {};
for (int i=0;i<N;i++) {
switches[i] = i;
}
answer(combination, switches);
}
# | 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... |