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