计蒜客 2020 蓝桥杯省赛 B 组模拟赛（二）结果填空：迷宫

•  1000ms
•  131072K

下图给出了一个迷宫的平面图，其中标记为 11 的为障碍，标记为 00 的为可以通行的地方。

迷宫的入口为左上角，出口为右下角，在迷宫中，只能从一个位置走到这个它的上、下、左、右四个方向之一。

对于上面的迷宫，从入口开始，可以按 DRRURRDDDR 的顺序通过迷宫，一共 1010 步。其中 D、U、L、R 分别表示向下、向上、向左、向右走。

对于下面这个迷宫（3030 行 5050 列），我们可以最上方一行的任意一个格子作为入口；以最下方一行的任意一个格子作为出口。请找出通过迷宫步数最少的路径有多少条。

01010101001011001001010110010110100100001000101010
00001000100000101010010000100000001001100110100101
01111011010010001000001101001011100011000000010000
01000000001010100011010000101000001010101011001011
00011111000000101000010010100010100000101100000000
11001000110101000010101100011010011010101011110111
00011011010101001001001010000001000101001110000000
10100000101000100110101010111110011000010000111010
00111000001010100001100010000001000101001100001001
11000110100001110010001001010101010101010001101000
00010000100100000101001010101110100010101010000101
11100100101001001000010000010101010100100100010100
00000010000000101011001111010001100000101010100011
10101010011100001000011000010110011110110100001000
10101010100001101010100101000010100000111011101001
10000000101100010000101100101101001011100000000100
10101001000000010100100001000100000100011110101001
00101001010101101001010100011010101101110000110101
11001010000100001100000010100101000001000111000010
00001000110000110101101000000100101001001000011101
10100101000101000000001110110010110101101010100001
00101000010000110101010000100010001001000100010101
10100001000110010001000010101001010101011111010010
00000100101000000110010100101001000001000000000010
11010000001001110111001001000011101001011011101000
00000110100010001000100000001000011101000000110011
10101000101000100010001111100010101001010000001000
10000010100101001010110000000100101010001011101000
00111100001000010000000110111000000001000000001011
10000001100111010111010001000110111010101101111000

思路：BFS+vis数组应用

#include
#include
#include
#include
#include
#include

using namespace std;

typedef long long ll;

char g[60][60];
int vis[60][60];
int n,m;

struct node{
	int x,y,z;
};

queue q;
vector ans;

int mov[4][2] = {0,1,0,-1,-1,0,1,0};
int ANS = 0;
int MIN = 0x3f3f3f3f;
void bfs()
{
	memset(vis, 0x3f, sizeof vis);//到达当前点最少步数
		
	while(!q.empty())
	{
		node p = q.front();
		q.pop();
		
		int x = p.x;
		int y = p.y;
		int z = p.z;		
		
		if(x == n) 
		{
			if(z < MIN) 
			{
				ANS = 1;
				MIN = z;
			}
			else if(z == MIN) ANS++;
			continue; 
		}
		
		for(int t=0; t<4; t++)
		{
			int nx = x + mov[t][0];
			int ny = y + mov[t][1];
			int nz = z + 1;
			if(nx >= 1 && nx <= n && ny >= 1 && ny <= m && g[nx][ny] == '0' && vis[nx][ny] >= nz)
			{
				q.push({nx, ny, nz});
				vis[nx][ny] = nz;
			}
		}
	}
}

int main()
{
	freopen("in.txt","r",stdin);
	freopen("out.txt","w",stdout);
	
	cin>>n>>m;
	for(int i=1; i<=n; i++)
		for(int j=1; j<=m; j++)
		{
			scanf(" %c ",&g[i][j]);
		}
		
	for(int i=1; i<=m; i++)
	{
		if(g[1][i] == '0') q.push({1,i,0});		
	}
	
	bfs();
	
	cout<