# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
456249 | osmanallazov | 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>
#include "cave.h"
using namespace std;
void exploreCave(int N) {
int s[N],d[N];
memset(s, 0, sizeof s);
if(tryCombination(S)==-1) {
for(int i=0;i<N;i++) {
s[i]=1;
d[i]=tryCombination(s);
s[i]=0;
} answer(s,d);
}
for(int i=0;i<N;i++) {
int x=tryCombination(s);
if(x==-1)
break;
if(x<=i)
s[i]^=1;
}
for(int i=0;i<N;i++)
d[i]=i;
answer(d,d);
}