Submission #456234

#TimeUsernameProblemLanguageResultExecution timeMemory
456234KhizriCave (IOI13_cave)C++17
0 / 100
43 ms364 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);
    	bool r=false;
    	for(int j=i+1;j<n;j++){
    		a[i]=1;
    		int x=tryCombination(a);
    		if(x!=q){
    			r=true;
    			a[i]=0;
    			break;
			}
    		a[i]=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...