# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
235298 | pere_gil | Cave (IOI13_cave) | C++14 | 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 <iostream>
#include "cave.h"
using namespace std;
void exploreCave(int N)
{
int D[N],S[N];
for(int i=0;i<N;i++){ S[i]=0; }
if(tryComnination(S)!=N-1){
for(int i=0;i<N;i++){ D[i]=i; }
for(int i=0;i<N;i++){
if(tryCombination(S)==i) S[i]=1;
}
}
else{
for(int i=0;i<N;i++){
S[i]=1;
D[i]=tryCombination(S);
S[i]=0;
}
}
answer(S,D);
}