Submission #456267

#TimeUsernameProblemLanguageResultExecution timeMemory
456267KhizriCave (IOI13_cave)C++17
13 / 100
23 ms376 KiB
#include "cave.h"
int arr[5005],a[5005],b[5005];
void exploreCave(int n) {
    //tryCombination(int S[])
    for(int i=0;i<=n;i++){
    	a[i]=b[i]=0;
	}
    for(int i=0;i<n;i++){
    	a[i]=0;
    	int q=tryCombination(a);
    	a[i]=1;
    	int q2=tryCombination(a);
    	a[i]=0;
    	if(q==-1){
    		break;
		}
		else if(q2==-1){
			a[i]=1;
			break;
		}
		else{
			bool f=false;
			for(int j=i+1;j<n;j++){
				a[j]=1;
				if(tryCombination(a)!=q){
					a[j]=0;
					f=true;
					break;
				}
				a[j]=0;
			}
			if(!f){
				a[i]=1;	
			}
		}
	}
	for(int i=0;i<n;i++){
		int k=a[i];
		a[i]=1-k;
		b[i]=tryCombination(a);
		a[i]=k;
	}
	answer(a,b);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...