# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
882317 | dubabuba | 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>
const int mxn = 5050;
void exploreCave(int N) {
bool d[N], id[N];
memset(d, 0, sizeof d);
while(1) {
int i = tryCombination(d);
d[i] = 1;
}
for(int i = 0; i < N; i++)
id[i] = i;
answer(d, id);
}