Submission #456238

#TimeUsernameProblemLanguageResultExecution timeMemory
456238Khizri동굴 (IOI13_cave)C++17
13 / 100
52 ms368 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]=0;
    	int q=tryCombination(a);
    	if(q==-1){
    		a[i]=1;
    		b[i]=tryCombination(a);
    		a[i]=0;
		}
    	else{
    		bool r=false;
	    	for(int j=i+1;j<n;j++){
	    		a[j]=1;
	    		int x=tryCombination(a);
	    		if(x!=q){
	    			r=true;
	    			a[j]=0;
	    			break;
				}
	    		a[j]=0;
			}
			if(!r){
				b[i]=q;
				a[i]=1;
			}
			else{
				a[i]=1;
				b[i]=tryCombination(a);
				a[i]=0;
			}
		}
	}
	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...