#include
#include
#include
char a[17][17];
int mark[17][17];
int tou=1;
int wei=1;
int step[17][17];
int n,m;
struct node
{
int hang;
int lie;
}duilie[9999];
int bfs(int kai1,int kai2,int end1,int end2)
{
if(kai1n||kai2m||kai2>15||a[kai1][kai2]=='#') return -1;
mark[kai1][kai2]=1;
duilie[1].hang=kai1;
duilie[1].lie=kai2;
wei++;
int t1,t2,temp1,temp2,i;
while(tou!=wei)
{
t1=duilie[tou].hang;
t2=duilie[tou].lie;
tou++;
for(i=0;i<=3;i++)
{
if(i==0)//向上
{
temp1=t1+1;
temp2=t2;
}
if(i==1)//向下
{
temp1=t1-1;
temp2=t2;
}
if(i==2)//向左
{
temp1=t1;
temp2=t2-1;
}
if(i==3)//向右
{
temp1=t1;
temp2=t2+1;
}
if(temp1n||temp2m||temp2>15||a[temp1][temp2]=='#') continue;
if(!mark[temp1][temp2])
{
//printf("%d****%d\n",temp1,temp2);
step[temp1][temp2]=step[t1][t2]+1;
mark[temp1][temp2]=1;
if(temp1==end1&&temp2==end2) return step[temp1][temp2];
duilie[wei].hang=temp1;
duilie[wei].lie=temp2;
wei++;
}
}
}
}
int main()
{
int kai1,kai2,end1,end2;
while(~scanf("%d%d",&n,&m))
{
tou=1,wei=1;
memset(mark,0,sizeof(a));
memset(step,0,sizeof(step));
getchar();
int i;
int j;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
scanf("%c",&a[i][j]);
}
getchar();
}
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
if(a[i][j]=='X')
{
kai1=i;
kai2=j;
}
if(a[i][j]=='Y')
{
end1=i;
end2=j;
}
}
int sum=bfs(kai1,kai2,end1,end2);
if(mark[kai1][kai2]==1&&mark[end1][end2]==1)
printf("%d\n",sum);
else printf("-1\n");
}
}
/**************************************
Problem id : SDUT OJ 2779
Result : Runtime Error
Take Memory : 0K
Take Time : 0MS
Submit Time : 2016-06-14 21:14:31
**************************************/
题目链接：http://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=2779
