[BZOJ3109][cqoi2013]新数独 && 搜索

裸搜 除了读入麻烦 其他裸到爆的题 10S...

#include<cstdio>  
#include<algorithm>  
#include<cstring>  
#include<iostream>  
#define SF scanf  
#define PF printf
using namespace std;
const int MAXN = 10;
int M[MAXN+10][MAXN+10][MAXN+10][MAXN+10], r = 1, c = 2;
bool visr[MAXN+10][MAXN+10], visc[MAXN+10][MAXN+10], visn[MAXN+10][MAXN+10];
int ans[MAXN+10][MAXN+10];
char s[10];
const int idx[10][10]= 
{{0,0,0,0,0,0,0,0,0,0},
{0,1,1,1,2,2,2,3,3,3},
{0,1,1,1,2,2,2,3,3,3},
{0,1,1,1,2,2,2,3,3,3},
{0,4,4,4,5,5,5,6,6,6},
{0,4,4,4,5,5,5,6,6,6},
{0,4,4,4,5,5,5,6,6,6},
{0,7,7,7,8,8,8,9,9,9},
{0,7,7,7,8,8,8,9,9,9},
{0,7,7,7,8,8,8,9,9,9}};
void Read()
{
	for(int k = 1; k <= 3; k++) {
		for(int j = 1; j <= 2; j++) {
			for(int i = 1; i <= 3; i++) {
				SF("%s", s);
				M[r][c][r][c-1] = (s[0] == '>' ? -1 : 1);
				SF("%s", s);
				M[r][c+1][r][c] = (s[0] == '>' ? -1 : 1);
				c += 3;
			}
			for(int i = 1; i <= 9; i++) {
				SF("%s", s);
				M[r+1][i][r][i] = (s[0] == 'v' ? -1 : 1);
			}
			r++; c = 2;
		}
		for(int i = 1; i <= 3; i++) {
			SF("%s", s);
			M[r][c][r][c-1] = (s[0] == '>' ? -1 : 1);
			SF("%s", s);
			M[r][c+1][r][c] = (s[0] == '>' ? -1 : 1);
			c += 3;
		}
		r++; c = 2;
	}
}
void print() 
{
	for(int i = 1; i <= 9; i++) {
		for(int j = 1; j < 9; j++) PF("%d ", ans[i][j]);
		PF("%d\n", ans[i][9]);
	}
}
bool check(int x, int y, int num)
{
	if(M[x][y][x][y-1] == 1 && num <= ans[x][y-1]) return false;
	if(M[x][y][x][y-1] == -1 && num >= ans[x][y-1]) return false;
	if(M[x][y][x-1][y] == 1 && num <= ans[x-1][y]) return false;
	if(M[x][y][x-1][y] == -1 && num >= ans[x-1][y]) return false;
	return true;
}
void dfs(int x, int y)
{
	if(x == 10) { print(); exit(0); }
	for(int i = 1; i <= 9; i++)
		if(!visr[x][i] && !visc[y][i] && !visn[idx[x][y]][i] && check(x, y, i))
		{
			ans[x][y] = i;
			visr[x][i] = visc[y][i] = visn[idx[x][y]][i] = true;
			if(y == 9) dfs(x+1, 1);
			else dfs(x, y+1);
			visr[x][i] = visc[y][i] = visn[idx[x][y]][i] = false;
		}
}
int main()
{
	Read();
	dfs(1, 1);
}