# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
992859 | vjudge1 | Cave (IOI13_cave) | C++17 | 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;
// int tryCombination(int S[]);
// void answer(int S[], int D[]);
#define ask(x) tryCombination(x)
void exploreCave(int n) {
int lvr[n] = {}, pos[n];
iota(pos, pos + n, 0);
for(int i = 0; i < n; i++){
lvr[i] = ask(lvr) != i;
}
anser(lvr, pos);
}