# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
235290 | pere_gil | 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 <iostream>
#include "cave.h"
using namespace std;
void exploreCave(int N)
{
int D[n],S[N];
for(int i=0;i<N;i++){ D[i]=i; S[i]=0; }
int open=tryCombination(S);
while(open<N){
if(S[open]==0){ S[open]=1; }
else S[open]=0;
open=tryComination(S);
}
answer(S,D);
}