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 <algorithm>
void exploreCave(int N) {
int combination[N] = {0};
int S[N];
for(int i = 0; i < N; i++) {
S[i] = 1;
}
int D[N];
for(int i = 0; i < N; i++) {
D[i] = i;
}
for(int i = 0; i < N; i++) {
combination[i] = 1;
int x = tryCombination(combination);
if(x == i) {
S[i] = 0;
combination[i] = 0;
}
}
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... |