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 <vector>
#include "cave.h"
using namespace std;
void exploreCave(int n){
int S[n];
int D[n];
for(int i = 0; i < n; i++){
S[i] = 0;
D[i] = i;
}
int k = 0;
while(k<n){
k = tryCombination(S);
if(k==-1){
break;
}
S[k] ^=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... |