Submission #1103151

#	Time	Username	Problem	Language	Result	Execution time	Memory
1103151		coolboy19521	Cave (IOI13_cave)	C++17	0 / 100	214 ms	564 KiB

cave

#include "cave.h"

void exploreCave(int N) {
	int s[N];
	int d[N];
	for (int i = 0; i < N; i ++) {
		s[i] = -1;
		d[i] = -1;
	}
	auto ask = [&s,N](int mi, int df){
		int q[N];
		for (int i = 0; i < N; i ++) {
			if (-1 != s[i]) {
				q[i] = s[i];
			} else if (i <= mi) {
				q[i] = df;
			} else {
				q[i] = 1 - df;
			}
		}
		return tryCombination(q);
	};
	for (int i = 0; i < N; i ++) {
		int r = ask(N - 1, 1);
		int df = (i <= r ? 1 : 0);
		int lo = 0;
		int hi = N - 1;
		while (lo < hi) {
			int mi = (lo + hi) / 2;
			int r = ask(mi, df);
			if (i <= r) {
				hi = mi;
			} else {
				lo = mi + 1;
			}
		}
		s[lo] = df;
		d[lo] = i;
	}
	answer(s, d);
}

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