NOIP2009 靶形数独 DFS

题目链接

http://noi-test.zzstep.com/contest/0x29%E3%80%8C%E6%90%9C%E7%B4%A2%E3%80%8D%E7%BB%83%E4%B9%A0/2901%20%E9%9D%B6%E5%BD%A2%E6%95%B0%E7%8B%AC

分析

经典的数独问题，每次选择一个可选数最少的位置，枚举放置的数，继续搜索。

AC代码

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

inline int read() {
	int num = 0;
	char c = getchar();
	while (c < '0' || c > '9') c = getchar();
	while (c >= '0' && c <= '9')
		num = num * 10 + c - '0', c = getchar();
	return num;
}

const int maxn = 15;

int map[maxn][maxn], f[1 << 9], cnt[1 << 9], ans;
int r[maxn], c[maxn], p[maxn];

inline int pos(int x, int y) {
	return x / 3 * 3 + y / 3;
}

inline void change(int x, int y, int k) {
	r[x] ^= 1 << k, c[y] ^= 1 << k, p[pos(x, y)] ^= 1 << k;
}

inline int grade() {
	int sum = 0;
	for (int i = 0; i < 9; ++i)
		for (int j = 0; j < 9; ++j)
			sum += map[i][j] * (min(i, min(j, min(8 - i, 8 - j))) + 6);
	return sum;
}

void dfs(int tot) {
	if (!tot) {
		ans = max(ans, grade());
		return;
	}
	int mc = 10, x, y;
	for (int i = 0; i < 9; ++i)
		for (int j = 0; j < 9; ++j)
			if (!map[i][j]) {
				int state = r[i] & c[j] & p[pos(i, j)];
				if (cnt[state] < mc) mc = cnt[state], x = i, y = j;
			}
	int state = r[x] & c[y] & p[pos(x, y)];
	while (state) {
		int k = f[state & -state];
		state -= state & -state;
		map[x][y] = k + 1;
		change(x, y, k);
		dfs(tot - 1);
		map[x][y] = 0;
		change(x, y, k);
	}
}

int main() {
	for (int i = 0; i < 9; ++i) f[1 << i] = i;
	for (int i = 1; i < (1 << 9); ++i) cnt[i] = cnt[i - (i & -i)] + 1;
	for (int i = 0; i < 9; ++i) r[i] = c[i] = p[i] = (1 << 9) - 1;
	int tot = 0;
	for (int i = 0; i < 9; ++i)
		for (int j = 0; j < 9; ++j) {
			map[i][j] = read();
			if (map[i][j]) change(i, j, map[i][j] - 1);
			else ++tot;
		}
	dfs(tot);
	if (ans) printf("%d", ans);
	else printf("-1");
	return 0;
}