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"
#include "bits/stdc++.h"
#define F first
#define S second
#define ll long long
#define pii pair<ll,ll>
const int mxN = 4e6 + 5;
const int mod = 1e9 + 7;
using namespace std;
void exploreCave(int N) {
int c[N] = {},ans[N];
for(int i = 0;i < N;i++){
c[i] = 1;
int x = tryCombination(c);
ans[i] = x;
}
c[N] = 0;
answer(c,ans);
}
# | 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... |