Submission #108282

#	Time	Username	Problem	Language	Result	Execution time	Memory
108282		maruii	Cave (IOI13_cave)	C++14	100 / 100	1517 ms	596 KiB

cave

#include "cave.h"
#include <memory.h>
int S[5000], D[5000];
bool F[5000];
void exploreCave(int N) {
	memset(F, 0, sizeof(F));
	for(int i=0; i<N; ++i){
		for(int j=0; j<N; ++j) if(!F[j]) S[j] = 0;
		int t = i != tryCombination(S), x = 0;
		for(int j=0; j<13; ++j){
			for(int k=0; k<N; ++k) if(!F[k]) S[k] = t ^ ((k>>j) & 1);
			x |= (tryCombination(S) != i) << j;
		}
		S[x] = t ^ 1;
		D[x] = i;
		F[x] = 1;
	}
	answer(S, D);
}

• Subtask 1: 12 / 12
• Subtask 2: 13 / 13
• Subtask 3: 21 / 21
• Subtask 4: 30 / 30
• Subtask 5: 24 / 24