SWUST OJ 4: Maze Problem

本题的概念如下，但是由于OJ，你懂的，这个题是这样做但是过不了，所以希望你能学会这种方法，而不是直接复制，会WA的.

题目描述

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

输入

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.

输出

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

样例输入

1
5 5
s-###
-----
##—
E#—
— ##

样例输出

9

题解

本题为最简单的迷宫最短路径问题.我们在这里利用了队列函数，将每一步存放在队列中，知道最先到达‘E’的那一点，详细请看解答过程中的注释.

#include<iostream>
#include<queue>//队列
#include<string.h>
#include<string>
#include<stdio.h>
#include<math.h>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;//typedef函数可以long long 简化为ll
const int N=1e3+5;//定义一个定值N
char mp[N][N];//画出地图
int flag[N][N];//