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 S[n], D[n];
memset(S, 0, sizeof(S));
memset(D, 0, sizeof(D));
for(int i=0; i<n; i++) {
for(int j=0; j<2; j++) {
S[i] ^= 1;
int p = tryCombination(S);
if(p > i || p == -1) break;
S[i] ^= 1;
}
}
for(int i=0; i<n; i++) D[i] = i;
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... |