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 <bits/stdc++.h>
#include "cave.h"
using namespace std;
int N;
void exploreCave(int n) {
int s[n];
int d[n];
for (int i = 0; i < n; i++)
{
s[i] = 0;
d[i] = i;
}
for (int i = 0; i < n; i++)
{
s[i] = 1;
int x = tryCombination(s);
if (x == i)
{
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... |