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 <bits/stdc++.h>
/*
ID: c4ts0up
LANG: C++
TASK: cave
*/
const int NMAX = 5005;
int S[NMAX], D[NMAX];
void exploreCave(int n) {
// disposicion inical
for (int i=0; i<n; i++) S[i] = 0;
int q = tryCombination(S);
while (q != -1) {
S[q] = 1;
q = tryCombination(S);
}
// llenamos el D
for (int i=0; i<n; i++) D[i] = i;
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... |