# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
984587 | SzymonKrzywda | Cave (IOI13_cave) | C++17 | 0 ms | 0 KiB |
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>
using namespace std;
int tryCombination(int S[]);
void answer(int S[],int D[]);
void exploreCave(int N){
int S[N];
int D[N];
int w = 0;
while (w != -1){
w = tryCombination(S);
if (w != -1) S[w] = 1;
}
for (int i=0; i<N; i++){
S[i] = (S[i]+1)%2;
D[i] = tryCombination(S);
S[i] = (S[i]+1)%2;
}
answer(S,D);
}