Submission #482617

#	Time	Username	Problem	Language	Result	Execution time	Memory
482617		thiago_bastos	Cave (IOI13_cave)	C++17	0 / 100	35 ms	332 KiB

cave

#include "cave.h"
 
const int MAXN = 5000;
 
int S[MAXN], B[MAXN], D[MAXN];
 
void exploreCave(int N) {
	for(int i = 0; i < N; ++i) S[i] = 0;
	
	int door = tryCombination(S);
	
	while(door >= 0) {
		for(int j = 0; j < N; ++j) {
			S[j] ^= 1;
			int ans = tryCombination(S);
			if(ans > door || ans < 0) {
              	door = ans;
                break;
            }
			S[j] ^= 1;
		}
	}
	
	for(int i = 0; i < N; ++i) B[i] = S[i] ^ 1;
 
	for(int i = 0; i < N; ++i) {
		S[i] ^= 1;
		D[i] = tryCombination(S);
		S[i] ^= 1;
	}
	
	answer(B, D);
}

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