题目大意:输入为由1到4和’*‘组成的4X4的字符矩阵,要求将’*‘处填上数字,使得每行、每列、四角的4个2X2的小方格为1、2、3、4各一个数字
解题思路:将需要填数的位置记录下来,对于每个点一个数字一个数字的试探搜索
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pi;
vector<pi> v;
char maze[5][5];
int Map[5][5];
int ok;
int vish[5][5],visl[5][5],visk[5][5];
int belong(int x,int y)///计算所属方格的序号
{
return x/2*2+y/2;
}
void dfs(int pp)
{
if(pp==v.size())
{
ok = 1;
for(int i=0;i<4;i++)
{
for(int j=0;j<4;j++)
{
printf("%d", Map[i][j]);
}
printf("\n");
}
return ;
}
for(int i=1;i<=4;i++)
{
if(!vish[v[pp].first][i] && !visl[v[pp].second][i] && !visk[belong(v[pp].first,v[pp].second)][i])
{
vish[v[pp].first][i] = visl[v[pp].second][i] = visk[belong(v[pp].first, v[pp].second)][i] = 1;
Map[v[pp].first][v[pp].second] = i;
dfs(pp+1);
vish[v[pp].first][i] = visl[v[pp].second][i] = visk[belong(v[pp].first,v[pp].second)][i] = 0;///注意还原
}
}
return;
}
int main()
{
int t;
scanf("%d",&t);
int cs = 0;
while(t--)
{
v.clear();
for(int i=0;i<4;i++)
scanf("%s",maze[i]);
memset(Map,0,sizeof(Map));
memset(vish,0,sizeof(vish));
memset(visl,0,sizeof(vish));
memset(visk,0,sizeof(vish));
for(int i=0;i<4;i++)
{
for(int j=0;j<4;j++)
{
if(maze[i][j]=='*')
v.push_back(make_pair(i,j));
else
{
Map[i][j] = maze[i][j]-'0';
vish[i][Map[i][j]] = 1;///i行有该数了
visl[j][Map[i][j]] = 1;///j列有该数了
visk[belong(i,j)][Map[i][j]] = 1;///该小方格有该数了
}
}
}
ok = 0;
printf("Case #%d:\n",++cs);
dfs(0);
}
return 0;
}