Submission #168128

#	Time	Username	Problem	Language	Result	Execution time	Memory
168128		RoundMango	동굴 (IOI13_cave)	C++14	0 / 100	86 ms	516 KiB

cave

#include <bits/stdc++.h>
#include "cave.h"
using namespace std;
int n, door[1000000], sw[100000], l , r, mid, ans[100000], first, second;
void exploreCave(int n) {
	for (int x = 0; x < n; x++) {
		first = tryCombination(door);
		l = 0, r = n-1;
		while (l != r) {
			mid = (l+r)/2;
			for (int i = l; i <= r; i++) if (!ans[i]) door[i] ^= 1;
			second = tryCombination(door);
			for (int i = l; i <= r; i++) if (!ans[i]) door[i] ^= 1;
			if (first == second) l = mid+1;
			else r = mid;
		}
		ans[l]++;
		sw[l] = x;
		if (first <= x || first != -1) door[l] = 1;
	}
	answer(sw, door);
}

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