Submission #511083

#TimeUsernameProblemLanguageResultExecution timeMemory
511083bebecanvasCave (IOI13_cave)C++14
25 / 100
24 ms368 KiB
#include "cave.h"

void exploreCave(int N) {
    int d[N];
    
    int s[N];
    for(int i=0; i<N; i++){s[i]=0;}
    while(tryCombination(s)!=-1){
		int a= tryCombination(s);
		s[a]+=1; s[a]%=2;
	}
	
	for(int i=0; i<N; i++){
		s[i]+=1; s[i]%=2;
		int a= tryCombination(s);
		d[i]=a;
		s[i]+=1; s[i]%=2;
	}
	
	answer(s, d);
	
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...