| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 432085 | MilosMilutinovic | 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 "code.h"
#include <bits/stdc++.h>
using namespace std;
int tryCombination(int S[]);
void answer(int S[], int D[]);
void exploreCave(int N) {
int combination[N];
for (int i = 0; i < N; i++)
combination[i] = 0;
if (tryCombination(combination) == -1) {
int position[N];
for (int i = 0; i < N; i++) {
combination[i] = 1;
position[i] = tryCombination(combination);
combination[i] = 0;
}
answer(combination, position);
}
for (int i = 0; i < N; i++) {
if (tryCombination(combination) == i)
combination[i] = 1;
int position[N];
for (int i = 0; i < N; i++)
position[i] = i;
answer(combination, position);
}