# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
134338 | arthurconmy | 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 <bits/stdc++.h>
using namespace std;
#ifndef ARTHUR_LOCAL
#include "cave.h"
#endif
int combo[n];
int D[n];
void exploreCave(int n)
{
for(int i=0; i<n; i++) D[i]=i;
for(int i=0; i<n; i++)
{
int cur = tryCombination(combo);
if(cur==i) combo[i]=1-combo[i];
if(cur==-1) answer(combo,D);
}
answer(combo, D);
}