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 forr(i,A,B) for(int i=A;i<B;++i)
using namespace std;
void exploreCave(int N) {
int a[N]={0},ans[N],done[N];
memset(ans,-1,sizeof ans);
memset(done,-1,sizeof done);
forr(i,0,N) ans[i]=i;
int lo=tryCombination(a);
forr(i,0,N){
lo=tryCombination(a);
if(lo==-1) break;
a[lo]=!a[lo];
}
answer(a,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... |