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 <bits/stdc++.h>
#include "cave.h"
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;
void exploreCave(int N) {
int q[N],g[N];
for(int i=0;i<N;i++){
q[i]=1;
}
for(int i=0;i<N;i++){
g[i]=i;
}
for(int i=0;i<N;i++){
int res=tryCombination(q);
if(res>=i+1 or res==-1)continue;
q[i]=0;
}
answer(q,g);
}
# | 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... |