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 <iostream>
#include "cave.h"
using namespace std;
void exploreCave(int N)
{
int D[N],S[N];
for(int i=0;i<N;i++){ D[i]=i; S[i]=0; }
for(int i=0;i<N;i++){
if(tryCombination(S)==i) S[i]=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... |