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 <vector>
using namespace std;
void answer(int S[], int D[]);
int tryCombination(int S[]);
int s[5000], d[5000];
void exploreCave(int n) {
for (int i = 0; i < n; i++) s[i] = 0, d[i] = -1;
for (int i = 0; i < n; i++)
{
s[i] = 1;
d[i] = tryCombination(s);
s[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... |