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;
void exploreCave(int N) {
int S[N], D[N];
memset(S, 0, sizeof S);
if(tryCombination(S) == -1) {
for(int i = 0; i < N; i++) {
S[i] = 1;
D[i] = tryCombination(S);
S[i] = 0;
} answer(S, D);
}
for(int i = 0; i < N; i++) {
int x = tryCombination(S);
if(x == -1) break;
if(x <= i) 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... |