#include <iostream>
#include <cstdio>
#include <queue>
#include <cstring>
using namespace std;
const int N=10005;
const int INF=1<<30;//无穷大
typedef pair<int,int> P;
char maze[N][N];
int dis[N][N];
int n,m;
int sx,sy,gx,gy;
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
int bfs(){
queue<P> q;
q.push(P(sx,sy));
dis[sx][sy]=0;
while(!q.empty()){
P p=q.front();
q.pop();
if(p.first==gx&&p.second==gy) break;
for(int i=0;i<4;i++){
int nx=p.first+dx[i],ny=p.second+dy[i];
if(nx>0&&nx<=n&&ny>0&&ny<=m&&maze[nx][ny]!='#'&&dis[nx][ny]==INF){
q.push(P(nx,ny));
dis[nx][ny]=dis[p.first][p.second]+1;
}
}
}
return dis[gx][gy];
}
int main(){
for(int i=1;i<N;i++){
for(int j=1;j<N;j++){
dis[i][j]=INF;
}
}
scanf("%d %d",&n,&m);
getchar();
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
scanf("%c",&maze[i][j]);
if(maze[i][j]=='S'){
sx=i,sy=j;
}
else if(maze[i][j]=='G'){
gx=i,gy=j;
}
}
getchar();
}
printf("%d\n",bfs());
}
/*
10 10
#S######.#
......#..#
.#.##.##.#
.#........
##.##.####
....#....#
.#######.#
....#.....
.####.###.
....#...G#
*/
BFS example
最新推荐文章于 2021-11-24 22:05:59 发布