简单的搜索题目,三中情况:①沿着左边查找②沿着右边查找③找对短路径(具有唯一性)。
#include<stdio.h>
#include<string.h>
int n,m;
int r[4][2]= {{0,-1},{1,0},{0,1},{-1,0}};
int l[4][2]= {{0,1},{1,0},{0,-1},{-1,0}};
int vis[50][50];
char map[50][50];
int sx,sy,ex,ey,ans;
int que[2500][2];
int dfs1(int x,int y,int step)
{
if(x==ex&&y==ey)
return step+1;
if(x<0||x>=n||y<0||y>=m||map[x][y]=='#')
return 0;
ans=(ans+3)%4;
int temp=0;
while(1)
{
temp=dfs1(x+l[ans][0],y+l[ans][1],step+1);
if(temp>0)
break;
ans=(ans+1)%4;
}
return temp;
}
int dfs2(int x,int y,int step)
{
if(x==ex&&y==ey)
return step+1;
if(x<0||x>=n||y<0||y>=m||map[x][y]=='#')
return 0;
ans=(ans+3)%4;
int temp=0;
while(1)
{
temp=dfs2(x+r[ans][0],y+r[ans][1],step+1);
if(temp>0)
break;
ans=(ans+1)%4;
}
return temp;
}
int bfs()
{
int fir=0,sec=0;
que[sec][0]=sx;
que[sec++][1]=sy;
vis[sx][sy]=1;
int step=1;
while(fir<sec&&!vis[ex][ey])
{
int tmp=sec;
step++;
while(fir<tmp&&!vis[ex][ey])
{
int x=que[fir][0];
int y=que[fir++][1];
for(int i=0; i<4; i++)
{
int x1=x+r[i][0];
int y1=y+r[i][1];
if(x1>=0&&x1<n&&y1>=0&&y1<m&&!vis[x1][y1]&&map[x1][y1]!='#')
{
que[sec][0]=x1;
que[sec++][1]=y1;
vis[x1][y1]=1;
}
}
}
}
return step;
}
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
scanf("%d%d",&m,&n);
memset(que,0,sizeof(que));
memset(vis,0,sizeof(vis));
for(int i=0; i<n; i++)
{
scanf("%s",map[i]);
for(int j=0; j<m; j++)
{
if(map[i][j]=='S')
{
sx=i;
sy=j;
}
if(map[i][j]=='E')
{
ex=i;
ey=j;
}
}
}
ans=0;
printf("%d",dfs1(sx,sy,0));
ans=0;
printf(" %d",dfs2(sx,sy,0));
printf(" %d\n",bfs());
}
return 0;
}