#include <bits/stdc++.h>
#include "cave.h"
//#include "grader.c"
using namespace std;
int arr[5003];
void make(int x,int n){
for(int i=0;i<n;i++) arr[i]=x;
}
void exploreCave(int N) {
int s=-1;
int ans=tryCombination(arr);
if(ans>0) s=ans;
else{
make(1,N);
ans=tryCombination(arr);
s=ans;
}
int key[N];
memset(key,-1,sizeof key);
int num=0;
bool flag=0;
while(num<N){
for(int i=0;i<N && num<N;i++){
arr[i]=!arr[i];
ans=tryCombination(arr);
if(ans==-1){
flag=1;
}
if(ans!=s){
key[s-1]=i;
num++;
if(ans<s) arr[i]=!arr[i];
s=ans;
}
}
}
answer(arr,key);
}
# | 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... |