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<iostream>
using namespace std;
int S[5000],D[5000];
void exploreCave(int N) {
int i;
for(i=0;i<N;i++) D[i]=i;
for(i=0;i<N;i++){
int x=tryCombination(S);
if(x==-1) break;
S[x]=1;
}
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... |