Submission #103624

#	Time	Username	Problem	Language	Result	Execution time	Memory
103624		turbat	Cave (IOI13_cave)	C++14	0 / 100	741 ms	480 KiB

cave

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


void exploreCave(int N) {
	int a[N], s[N], d[N], found[N], l, r, t;
	memset(s, 0, sizeof s);
	memset(found, 0, sizeof found);
	for (int i = 0;i < N;i++){
		for (int i = 0;i < N;i++)
			a[i] = s[i];
		int tmp = tryCombination(a);
		if (tmp > i || tmp == -1) t = 0;
		else t = 1;
		l = 0, r = N - 1;
		while (l != r){
			for (int i = 0;i < N;i++)
				a[i] = s[i];
			int mid = (l + r) / 2;
			for (int i = l;i <= mid;i++)
				if (!found[i])				
					a[i] = t;
			tmp = tryCombination(a);
			if (tmp > i || tmp == -1) r = mid;
			else l = mid + 1;
		}
		d[l] = i;
		found[l] = 1;
		s[l] = t;
	}
	answer(s, d);
}

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