Submission #511079

#TimeUsernameProblemLanguageResultExecution timeMemory
511079bebecanvas동굴 (IOI13_cave)C++14
25 / 100
27 ms428 KiB
#include "cave.h"

void exploreCave(int N) {
    int d[N];
    
    int s[N];
    int c[N];
    for(int i=0; i<N; i++){s[i]=0; c[i]=0;}
    while(tryCombination(s)!=-1){
		int a= tryCombination(s);
		s[a]+=1; s[a]%=2;
		c[a]+=1; c[a]%=2;
	}
	
	for(int i=0; i<N; i++){
		c[i]+=1; c[i]%=2;
		int a= tryCombination(c);
		d[i]=a;
		c[i]+=1; c[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...