#include <bits/stdc++.h>
#include <numeric>
using namespace std;
#include "cave.h"
void exploreCave(int N) {
int S[N], D[N];
for (int i=0;i<N;i++){
S[i] = 0;
D[i] = i;
}
for (int i=0;i<N;i++){
int ans = tryCombination(S);
if (ans == i) S[i] = 1;
else if (ans != i && ans != i+1) {
fill(S, S+N, 0);
break;
}
}
if (accumulate(S,S+N,0) == 0){
for (int i=0;i<N;i++){
S[i] = 1;
D[i] = tryCombination(S);
S[i] = 0;
}
}
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... |