# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
306322 | amunduzbaev | 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 "cave.h"
#include <bits/stdc++.h>
using namespace std;
void exploreCave(int n) {
vector<int>v(n);
vector<int>ans(n);
for(int i=0;i<n;i++){
ans[i]=i;
}
cor=tryCombination(v);
while(cor!=-1){
v[cor]=1;
tryCombination(v);
}
answer(v,ans);
}