hdu1252;http://acm.split.hdu.edu.cn/showproblem.php?pid=1252;
题目意思就是三个点p1,p2,p3;能否到同一点;注意移动一个点到i则要确保这个点到i点的颜色要与另外两个p点的颜色相同;才能移动,否则不能移动;
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<iostream>
#include<queue>
#include<algorithm>
#include<stack>
#include<set>
#include<string.h>
using namespace std;
char mp[54][54];
int n, p1,p2,p3;
struct node//这里的结构体并不是位置走向;
{
int x, y,z;
int step;
};
bool mark[55][55][55];
void bfs()
{
int i;
queue<node> q;
memset(mark,0,sizeof(mark));
node now,next;
now.x=p1;now.y=p2;now.z=p3;//这里的结构体并不是位置走向;
now.step=0;
mark[now.x][now.y][now.z] = 1;
q.push(now);
while(!q.empty())
{
now = q.front();
q.pop();
//printf("%d %d %d\n",now.x,now.y,now.z);
for(i = 1; i <= n; i++)//三个点各自到i点的的可行性及状态;以及入队列
{
if(!mark[i][now.y][now.z]&&mp[now.x][i]==mp[now.y][now.z])
{
mark[i][now.y][now.z]=1;
next.x=i;next.y=now.y;next.z=now.z;next.step=now.step+1;
if(next.x==next.y&&next.y==next.z)
{
//printf("%d %d %d\n",next.x,next.y,next.z);
printf("%d\n",next.step);
return ;
}
q.push(next);
}
if(!mark[now.x][i][now.z]&&mp[now.y][i]==mp[now.x][now.z])
{
mark[now.x][i][now.z]=1;
next.x=now.x;next.y=i;next.z=now.z;next.step=now.step+1;
if(next.x==next.y&&next.y==next.z)
{
//printf("%d %d %d\n",next.x,next.y,next.z);
printf("%d\n",next.step);
return ;
}
q.push(next);
}
if(!mark[now.x][now.y][i]&&mp[now.z][i]==mp[now.x][now.y])
{
mark[now.x][now.y][i]=1;
next.x=now.x;next.y=now.y;next.z=i;next.step=now.step+1;
if(next.x==next.y&&next.y==next.z)
{
//printf("%d %d %d\n",next.x,next.y,next.z);
printf("%d\n",next.step);
return ;
}
q.push(next);
}
}
}
printf("impossible\n");
return ;
}
int main()
{
char ch;
int i, j,len,l,k;
while(~scanf("%d",&n)&&n!=0)
{
scanf("%d %d %d",&p1,&p2,&p3);
getchar();
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
scanf("%c%c",&mp[i][j],&ch);
//printf("%c",mp[i][j]);//已结读入正确了;;;
}
//printf("%s\n",mp[i]);输出存在问题;%S从0开始输出的然而我们是从1开始赋值的;;;
}
if(p1==p2&&p2==p1)//已经是同一点了;;;
{
printf("0\n");
}
else bfs();
}
return 0;
}