POJ - 2676 Sudoku (DFS + 无脑剪枝)

题目链接：https://vjudge.net/problem/POJ-2676

上面是从a[0][0]到a[8][8]，下面是从a[8][8]到a[0][0]，不知道为什么会差别这么大…
以下剪枝方法过于无脑，萌新的做法…

代码如下：

#include<cstdio>
#include<map>
using namespace std;
map<int, int>vis[9];
inline int read() {
	char ch = getchar();
	while (ch == ' ' || ch == '\n')ch = getchar();
	if (ch == '*')ch = '0';
	return ch - '0';
}
int a[10][10];
bool ok;
bool check1(int x, int row, int col) {
	for (int i = 0; i < 9; i++)if (i != row && a[i][col] == x)return false;
	for (int j = 0; j < 9; j++)if (j != col && a[row][j] == x)return false;
	return true;
}
int check2(int x, int row, int col) {
	if (row <= 2) {
		if (col <= 2) {
			if (vis[0][x] == 1)return -1;
			else {
				vis[0][x] = 1; return 0;
			}
		}
		else if (col >= 6) {
			if (vis[6][x] == 1)return -1;
			else {
				vis[6][x] = 1; return 6;
			}
		}
		else {
			if (vis[3][x] == 1)return -1;
			else {
				vis[3][x] = 1; return 3;
			}
		}
	}
	else if (row >= 6) {
		if (col <= 2) {
			if (vis[2][x] == 1)return -1;
			else {
				vis[2][x] = 1; return 2;
			}
		}
		else if (col >= 6) {
			if (vis[8][x] == 1)return -1;
			else {
				vis[8][x] = 1; return 8;
			}
		}
		else {
			if (vis[5][x] == 1)return -1;
			else {
				vis[5][x] = 1; return 5;
			}
		}
	}
	else {
		if (col <= 2) {
			if (vis[1][x] == 1)return -1;
			else {
				vis[1][x] = 1; return 1;
			}
		}
		else if (col >= 6) {
			if (vis[7][x] == 1)return -1;
			else {
				vis[7][x] = 1; return 7;
			}
		}
		else {
			if (vis[4][x] == 1)return -1;
			else {
				vis[4][x] = 1; return 4;
			}
		}
	}
}
void dfs(int pos) {
	if (pos < 0) {
		ok = true;
		return;
	}
	int row = pos / 9, col = pos % 9;
	if (!a[row][col]) {
		for (int i = 1; i <= 9; i++) {
			if (check1(i, row, col)) {
				int tag = check2(i, row, col);
				if (tag != -1) {
					a[row][col] = i;
					dfs(pos - 1);
					if (!ok) {
						a[row][col] = 0;
						vis[tag][i] = 0;
					}
					else return;
				}
			}
		}
	}
	else dfs(pos - 1);
}
int main(void) {
	int n;
	scanf("%d", &n);
	while (n--) {
		for (int i = 0; i < 9; i++)
			vis[i].clear();
		for (int i = 0; i < 9; i++)
			for (int j = 0; j < 9; j++) {
				a[i][j] = read();
				if (i <= 2) {
					if (j <= 2)
						vis[0][a[i][j]] = 1;
					else if (j >= 6) 
						vis[6][a[i][j]] = 1;
					else 
						vis[3][a[i][j]] = 1;
				}
				else if (i >=6) {
					if (j <= 2)
						vis[2][a[i][j]] = 1;
					else if (j >= 6)
						vis[8][a[i][j]] = 1;
					else
						vis[5][a[i][j]] = 1;
				}
				else {
					if (j <= 2)
						vis[1][a[i][j]] = 1;
					else if (j >= 6)
						vis[7][a[i][j]] = 1;
					else
						vis[4][a[i][j]] = 1;
				}
			}
		ok = false;
		dfs(80);
		for (int i = 0; i < 9; i++) {
			for (int j = 0; j < 9; j++)
				printf("%d", a[i][j]);
			printf("\n");
		}
	}
	return 0;
}