# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
166568 | dyd | 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<bits/stdc++.h>
#include "cave.h"
const int MAXN=5010;
int s[MAXN];
int d[MAXN];
int tryCombination(int s[]);
void answer(int s[],int d[]);
int exploreCave(){
for(int i=0;i<n;i++){
d[i]=i;
if(tryCombination(s)==i) s[i]=1;
}
answer(s,d);
}