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 "graderlib.cpp"
#include "cave.h"
using namespace std;
const int mxN = 5005;
void exploreCave(int n) {
int switches[n];
int pos[n];
fill(switches, switches+n, 0);
for(int i = 0; i < n; i++) {
switches[i] = 1;
int first = tryCombination(switches);
pos[i] = first;
switches[i] = 0;
}
answer(switches, pos);
}
// int main() {
// int N = init();
// exploreCave(N);
// return 0;
// }
# | 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... |