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);
for(;;) {
int bad = tryCombination(S);
if(bad == -1) break;
for(int i = 0; i < N; i++) {
S[i] ^= 1;
int door = tryCombination(S);
if(door == -1 || door > bad) break;
S[i] ^= 1;
}
}
for(int i = 0; i < N; i++) {
S[i] ^= 1;
int door = tryCombination(S);
S[i] ^= 1;
D[i] = door;
} 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... |