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"
using namespace std;
const int MAXN=5005;
int S[MAXN],arr[MAXN];
void exploreCave(int N) {
for(int i=0;i<N;i++){
arr[i]=i;
S[i]=0;
int hai=tryCombination(S);
if(hai>i || hai==-1)continue;
else S[i]=1;
}
answer(S,arr);
}
# | 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... |