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 "iostream"
#include "vector"
#include "algorithm"
using namespace std;
void exploreCave(int N) {
int len = 1;
int tmp = 1;
while (N>tmp) {
len++;
tmp*=2;
}
int position[N];
for (int i = 0; i < N; i++)
position[i]=i;
int button[N];
fill(button, button+N, 0);
for (int i = 0; i < N; i++) {
int res = tryCombination(button);
if (res!=i) continue;
else button[i]=1;
}
answer(button, position);
}
# | 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... |