# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
874314 | asli_bg | 동굴 (IOI13_cave) | C++11 | 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 "cave.h"
const int MAXN=5e3+3;
int S[MAXN];
int D[MAXN];
void exploreCave(int N) {
/* ... */
for(int i=0;i<N;i++){
S[i]=0;
D[i]=i+1;
}
while(cev!=-1){
int cev=tryCombination(S);
if(cev==-1){
answer(S,D);
}
else{
S[cev]=1;
tryCombination(S);
}
}
}