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>
using namespace std;
void exploreCave(int N) {
vector <int> need_to_find;
for (int i = 0; i < N; i++)
need_to_find.push_back(i);
int s[N+1], d[N+1];
for (int i = 0; i < N; i++)
d[i] = i;
for (int i = 0; i < N; i++) {
s[i] = 1;
int res = tryCombination(s);
if (res == i)
s[i] = 0;
else
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... |