# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
647864 | Truitadepatates | 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>
using namespace std;
#include "cave.h"
void exploreCave(int n) {
int S[n];
int D[n];
for (int i = 0; i < n; i++){
S[i] = 0;
}
int a = tryCombination(int S[]);
if (a == -1){
for (int i = 0; i < n; i++){
S[i] = 1;
D[i] = tryCombination(int S[]);
S[i] = 0;
}
}
else{
for (int i = 0; i < n; i++){
D[i] = i;
}
while (a < n) {
S[a] = 1;
a = tryCombination(int S[]);
(if a == -1) break;
}
}
answer(int S[], int D[])
return 0;
}