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 vs[n],val[n],sw[n];
memset(vs, 0, sizeof vs);
memset(val, 0, sizeof val);
memset(sw, 0, sizeof sw);
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
if(!vs[j]){
val[j] = 0;
}
}
int x = tryCombination(val), what = 0;
if(x == i) what = 1;
for(int j = 0; j < n; j++){
if(!vs[j]){
val[j] = !what;
}
}
for(int j = 0; j < n; j++){
if(!vs[j]){
val[j] = what;
int ii = tryCombination(val);
if(ii == -1 or ii > i){
sw[j] = i;
vs[j] = 1;
break;
}
val[j] = !what;
}
}
}
answer(val, sw);
}
# | 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... |