Submission #29845

#	Time	Username	Problem	Language	Result	Execution time	Memory
29845		ozaslan	Cave (IOI13_cave)	C++14	46 / 100	57 ms	532 KiB

cave

#include "cave.h"
#define max_N 5005

int kul[max_N], S[max_N], D[max_N];

void exploreCave(int N) {

	int kapi = tryCombination(S);
	if(kapi == -1) {
		for (int i = 0; i < N; i++) {
			S[i] = 1;
			kapi = tryCombination(S);
			D[i] = kapi;
			S[i] = 0;
		}
		answer(S, D);
	}	

	for (int i = 0; i < N; i++) {
		int kapi = tryCombination(S);

		if (kapi != i) {
			for (int j = 0; j < N; j++)
				if (!kul[j]) {
					S[j] = 1;
					kapi = tryCombination(S);
					if (kapi == i) {
						S[j] = 0;
						D[j] = i;
						kul[j] = 1;
						break;
					}
					else
						S[j] = 0;
				}
		}
		else 
			for (int j = 0; j < N; j++)
				if (!kul[j]) {
					S[j] = 1;
					kapi = tryCombination(S);
					if (kapi > i || kapi == -1) {
						D[j] = i;
						kul[j] = 1;
						break;
					}
					else
						S[j] = 0;
				}

	}

	answer(S, D);
}

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