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];
for(int i = 0; i < n; i++) {
s[i] = 0;
d[i] = -1;
}
while(true) {
int curDoor = tryCombination(s);
if(curDoor == -1)
break;
for(int j = n - 1; j >= 0; j--) {
s[j] = 1 - s[j];
int door = tryCombination(s);
s[j] = 1 - s[j];
if(door == curDoor)
continue;
else {
s[j] = 1 - s[j];
break;
}
}
}
for(int i = 0; i < n; i++) {
if(d[i] != -1)
continue;
s[i] = 1 - s[i];
int door = tryCombination(s);
d[i] = door;
s[i] = 1 - s[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... |