白书2.1.5 迷宫的最短路径

#include <bits/stdc++.h>
using namespace std;

char maze[100][100];
int sx, sy, ex, ey, n, m;
int d[100][100], dx[4] = {1, -1, 0, 0}, dy[4] = {0, 0, 1, -1};

void bfs()
{
	memset(d, 0x3f3f3f3f, sizeof d);
	queue<pair<int, int> > que;
	que.push(make_pair(sx, sy));
	d[sx][sy] = 0;
	while (!que.empty()){
		pair<int, int> temp = que.front();
		que.pop();
		for (int i = 0; i < 4; ++i){
			int tx = temp.first + dx[i], ty = temp.second + dy[i];
			if (tx >= 0 && ty >= 0 && tx < n && ty < m && maze[tx][ty] != '#' && d[tx][ty] == 0x3f3f3f3f){
				que.push(make_pair(tx, ty));
				d[tx][ty] = d[temp.first][temp.second] + 1;
			}
		}
	}
}

int main()
{
	scanf("%d%d", &n, &m);
	getchar();
	for (int i = 0; i < n; ++i){
		for (int j = 0; j < m; ++j){
			scanf("%c", &maze[i][j]);
			if (maze[i][j] == 'S'){
				sx = i;
				sy = j;
			}else if (maze[i][j] == 'G'){
				ex = i;
				ey = j;
			}
		}
		getchar();
	}
	bfs();
	cout << d[ex][ey] << endl;
	return 0;
}

/*
10 10
#S######.#
......#..#
.#.##.##.#
.#........
##.##.####
....#....#
.#######.#
....#.....
.####.###.
....#...G#
*/