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"
using namespace std;
// binary search
// flip all left if first open door doesnt change
void exploreCave(int N){
int ans[N] = {};
if(tryCombination(ans) == -1){
int arr[N];
for(int i = 0; i < N; i++){
ans[i] ^= 1;
arr[i] = tryCombination(ans);
ans[i] ^= 1;
}
answer(ans,arr);
}
while(1){
int resp = tryCombination(ans);
if(resp == -1) break;
ans[resp] ^= 1;
}
int arr[N];
for(int i = 0; i < N; i++){
arr[i] = i;
}
answer(ans,arr);
}
# | 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... |