题目意思:hdu2514,给定一张图,空白的地方填上数字1-8,使得相邻位置所填的数字不能相邻。问有多少种填发,如没有则输出No answer,如不唯一输出Not unique,如答案唯一则输入唯一答案。
解题思路:暴力dfs,数据量很少。
代码明细:
//probID: hdu2514
//author: WiselyQY
//date: 2021-01-02
#include <bits/stdc++.h>
using namespace std;
int g[10],vis[10],ans,gans[10];
//判断在now位置放置num是否可行
int check(int now, int num)
{
if(now==1) return abs(num-g[0])!=1;
if(now==2) return abs(num-g[0])!=1 && abs(num-g[1])!=1;
if(now==3) return abs(num-g[0])!=1 && abs(num-g[2])!=1;
if(now==4) return abs(num-g[1])!=1 && abs(num-g[2])!=1;
if(now==5) return abs(num-g[1])!=1 && abs(num-g[2])!=1 && abs(num-g[3])!=1 && abs(num-g[4])!=1;
if(now==6) return abs(num-g[2])!=1 && abs(num-g[3])!=1 && abs(num-g[5])!=1;
if(now==7) return abs(num-g[4])!=1 && abs(num-g[5])!=1 && abs(num-g[6])!=1;
return 1;
}
void dfs(int now)
{
while(now<8 && g[now]) now++;
if(now==8)
{
ans++;
memcpy(gans,g,sizeof(g));
return;
}
//判断在now位置放置1-8是否可行
for(int i=1; i<=8; i++)
if(!vis[i] && !g[now] && check(now, i))
{
vis[i]=1;
g[now]=i;
dfs(now+1);
g[now]=0;
vis[i]=0;
}
}
int main()
{
clock_t start,end;
start=clock();
#ifndef ONLINE_JUDGE
freopen(R"(D:\code\hdu\2514\in.txt)","r",stdin);
#endif
int T,cases=0;
cin>>T;
while(T--)
{
cases++;
memset(vis,0,sizeof(vis));
for(int i=0; i<8; i++)
{
cin>>g[i];
if(g[i]) vis[g[i]]=1;
}
ans=0;
dfs(0);
cout<<"Case "<<cases<<": ";
if(!ans) cout<<"No answer"<<endl;
else if(ans>1) cout<<"Not unique"<<endl;
else
{
cout<<gans[0];
for(int i=1; i<8; i++) cout<<" "<<gans[i];
cout<<endl;
}
}
end=clock();
//printf("time=%lfs\n",(double)(end-start)/1000);
return 0;
}