Submission #30043

#	Time	Username	Problem	Language	Result	Execution time	Memory
30043		ozaslan	Cave (IOI13_cave)	C++14	0 / 100	98 ms	512 KiB

cave

#include "cave.h"
#define max_N 5005

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

void degis(int sol, int orta) {
	for(int i = sol; i <= orta; i++)
		if(!kul[i])
			S[i] = (S[i]+1) %2;
}

void exploreCave(int N) {

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

		int sol = 0, sag = N+1;
		int kapi = tryCombination(S);
		int acik = kapi > i || kapi == -1 ? 1: 0;

		while(sol != sag) {
			int orta = (sol + sag) / 2;
			degis(sol, orta);
			kapi = tryCombination(S);
			int sonra = kapi > i || kapi == -1 ? 1: 0;
			degis(sol, orta);
		
			if(sonra != acik)
				sag = orta;
			else
				sol = orta+1;
		}

		kul[sol] = 0;
		S[sol] = acik;
		D[sol] = i;
 
	}


	answer(S, D);
}

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