제출 #329057

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
329057		Farrius	동굴 (IOI13_cave)	C++11	51 / 100	222 ms	640 KiB

cave

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

using namespace std;

bool open (int res, int i) {
	return (res == -1 || res > i);
}

void exploreCave(int n) {
	int ok[n], par[n];
	vector<bool> skip(n, false);
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (skip[j]) continue;
			ok[j] = 1;
		}
		int res = tryCombination(ok);
		bool state = open(res, i);
		int lo = 0, hi = n - 1;
		int sol = hi;
		while (lo <= hi) {
			int mid = lo + (hi - lo)/2;
			for (int j = lo; j <= mid; j++) {
				if (skip[j]) continue;
				ok[j] ^= 1;
			}
			int cur = tryCombination(ok);
			bool cur_state = open(cur, i);
			if (state != cur_state) {
				hi = mid - 1;
				sol = mid;
			} else {
				lo = mid + 1;
			}
			state = cur_state;
		}
		par[sol] = i;
		state = open(tryCombination(ok), i);
		if (!state) ok[sol] ^= 1;
		skip[sol] = true;
	}/*
	for (auto x : ok) {
		cout << x << ' ';
	}
	cout << '\n';
	for (auto x : par) {
		cout << x << ' ';
	}
	cout << '\n';*/
	answer(ok, par);
}

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