# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
228746 | jhtan | 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"
using namespace std;
void exploreCave(int N) {
int S[N];
int D[N];
// 12 points
/*for(int i=0; i<N; i++) {
S[i] = 0;
D[i] = i;
}
for(int i=0; i<N; i++) {
int x = tryCombination(S);
if(x == -1) break;
if(x == i) S[i] = 1;
}
answer(S, D);*/
memset(S, 0, sizeof(S));
for(int i=0; i<N; i++) {
S[i] = 1;
D[tryCombination(S)] = i;
S[i] = 0;
}
answer(S, D);
}