# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
839298 | erekir | 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;
typedef long long ll;
void exploreCave(int N) {
vector<int> S(N),D(N);
for(int i=0;i<N;i++){
D[i] = i;
}
for(int i=0;i<N;i++){
if(tryCombination(S) == i){
S[i] = 1;
}
}
answer(S,D);
}