Submission #261554

#	Time	Username	Problem	Language	Result	Execution time	Memory
261554		c4ts0up	Cave (IOI13_cave)	C++17	34 / 100	48 ms	512 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>

/*
ID: c4ts0up
LANG: C++
TASK: cave
*/

const int NMAX = 5005;

int S[NMAX], D[NMAX];

void exploreCave(int n) {
	// disposicion final
	for (int i=0; i<n; i++) S[i] = 0;
	
	int puerta, res;
	while (puerta != -1) {
		
		/*//
		std::cerr << "S: ";
		for (int i=0; i<n; i++) std::cerr << S[i] << " ";
		std::cerr << std::endl;
		//*/
		
		puerta = tryCombination(S);
		
		//std::cerr << "Puerta = " << puerta << std::endl;
		
		if (puerta == -1) break;
		
		for (int i=0; i<n; i++) {
			S[i] = (S[i] == 0 ? 1 : 0);
			res = tryCombination(S);
			//std::cerr << "i = " << i << ", res = " << res << std::endl;
			if (res <= puerta && res != -1) S[i] = (S[i] == 0 ? 1 : 0);
			else break;
		}
	}
	
	// ya tenemos la combinacion correcta, ahora a identificar las puertas
	for (int i=0; i<n; i++) {
		S[i] = (S[i] == 0 ? 1 : 0);
		puerta = tryCombination(S);
		D[i] = puerta;
		S[i] = (S[i] == 0 ? 1 : 0);
	}
	
	answer(S, D);
}

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