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