# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
425788 | Apiram | 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) {
//trycombination(s);
vector<int>arr(n,0);
vector<int>d(n);
vector<int>ans;
for (int i =0;i<n;++i){
ans.push_back(arr[i]);
int a = trycombination(ans);
if (a==-1){
ans.pop_back();
ans.push_back(flip(arr[i]));
a=trycombination(ans);}
arr[i]=flip(ans.back());
d[i]=a;
ans.pop_back();
ans.push_back(arr[i]);
}
answer(arr,d);
}