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 par[5000], s[5000];
// par-mihez tartozik, 0-down, 1-up
void exploreCave(int n) {
// 1
for (int i=0; i<n; i++) {
par[i]=i;
}
while (true) {
int x=tryCombination(s);
if (x==-1) {
break;
}
s[x]=1;
}
answer(s, par);
}
# | 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... |