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"
//#include "grader.c"
using namespace std;
void exploreCave(int N) {
int a[N], b[N];
for (int i = 0; i < N; i++)
a[i] = b[i] = 0;
for (int i = 0; i < N; i++) {
a[i] = 1;
b[i] = tryCombination(a);
a[i] = 0;
}
answer(a, b);
/*sub1:
int a[N];
for (int i = 0; i < N; i++)
a[i] = 0;
for (int i = 0; i < N; i++)
if (tryCombination(a) == i) a[i] = 1;
int b[N];
iota(b, b + N, 0);
answer(a, b);
*/
}
# | 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... |