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"
#define DEBUG 0
using namespace std;
const int MX = 5e3 + 10;
int S[MX], D[MX];
void exploreCave(int N) {
for(int i = 0; i < N; i++) {
int res = tryCombination(S);
if(res == i) {
S[i] = 1;
}
else {
S[i] = 0;
}
}
for(int i = 0; i < N; i++) {
D[i] = i;
}
answer(S, D);
}
# | 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... |