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"
void exploreCave(int N) {
int arr[N], puerta[N];
int ayu = 0;
for(int i = 0; i < N; ++i){ arr[i] = 0; puerta[i] = i; }
for(int i = 0; i < N; ++i){
ayu = tryCombination(arr);
if(ayu == -1) break;
arr[ayu] = 1;
}
answer(puerta, arr);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |