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>
using namespace std;
void exploreCave(int N) {
int S[N+1];
int t[N+1];
for(int i = 0 ; i < N ; ++i) S[i] = 0, t[i] = i;
int val = tryCombination(S);
if(val == -1)
{
for(int i = 0 ; i < N ; ++i){
S[i] = 1;
t[i] = tryCombination(S);
S[i] = 0;
}
}
else{
while(val != -1) {
S[val] = !S[val];
val = tryCombination(S);
}
}
answer(S, t);
}
# | 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... |