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"
using namespace std;
void exploreCave(int N) {
int S[N];
int D[N];
//memset(S, 0, sizeof(S));
for(int i=0; i<N; i++) {
S[i] = 0;
D[i] = i + 1;
}
for(int i=0; i<N; i++) {
int x = tryCombination(S);
if(x == -1) break;
if(x == i) S[i] = 1;
}
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... |