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) {
int D[N], pos[N];
for (int i = 0; i < N; i++) pos[i] = i;
int cmx = tryCombination(D);
if (!(~cmx)) return void(answer(D, pos));
for (int i = cmx + 1; i < N; i++) {
int z0 = tryCombination(D);
if (z0 >= i) {D[i] = 0; continue;}
D[i] = 1;
}
answer(D, pos);
}
# | 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... |