HZNUOJ 1232 Maze Problem （BFS）

Description

Given a maze, find a shortest path from start to goal.

Input

Input consists serveral test cases.

First line of the input contains number of test case T.

For each test case the first line contains two integers N , M ( 1 <= N, M <= 100 ).

Each of the following N lines contain M characters. Each character means a cell of the map.

Here is the definition for chracter.

Constraint:

• For a character in the map:

• 'S' : start cell

• 'E' : goal cell

• '-' : empty cell

• '#' : obstacle cell

• no two start cell exists.

• no two goal cell exists.

Output

For each test case print one line containing shortest path. If there exists no path from start to goal, print -1.

Samples

input Copy

1

5 5

S-###

-----

##---

E#---

---##

output Copy

9

题意：S是起点 E是终点 ‘#’是障碍物不能走 ‘-’可以走，求从起点到终点要走的最短距离，走不到输出-1

解题思路：基础bfs，d数组用于存储步数，注意要把终点E改成‘-’要不然会一直输出-1；

ac代码：

#include <bits/stdc++.h>
using namespace std;
int n,m;
int stx,sty,endx,endy;
typedef pair<int,int> PII;
const int N=110;
int d[N][N];
char g[N][N];
int bfs()
{
    queue<PII> que;
    int dx[4]={-1,0,1,0};
    int dy[4]={0,-1,0,1};
    que.push({stx,sty});
    memset(d,-1,sizeof d);
    d[stx][sty]=0; //起点赋值为0
    while (!que.empty())
    {
        auto t=que.front();
        que.pop();
        for (int i=0;i<4;i++) //上下左右寻找可以走的点
        {
            int x=t.first + dx[i],y=t.second + dy[i];
            if(x>=1 && x<=n && y>=1 && y<=m && d[x][y]==-1 && g[x][y]=='-')
            {
                que.push({x,y});
                d[x][y] = d[t.first][t.second] +1;
            }
        }
    }
    return d[endx][endy]; //返回走到终点要走的步数
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin >> t;
    while (t--)
    {
        cin >> n >> m;
        for (int i=1;i<=n;i++)
        {
            for (int j=1;j<=m;j++)
            {
                cin >> g[i][j];
                if(g[i][j]=='S') stx=i,sty=j;
                if(g[i][j]=='E')
                {
                    endx=i,endy=j;
                    g[i][j]='-';
                }
            }
        }
//        cout << endx << ' ' << endy << endl;
//        cout << stx << ' ' << sty << endl;
        cout << bfs() << endl;
    }
    return 0;
}