蓝桥杯 迷宫

参考代码：

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int e[55][55], vis[55][55];  //e矩阵表示障碍物信息，vis矩阵表示点是否被访问过 
int m = 30, n = 50;
struct node{  //定义结构体，用于存放点的信息 
	int x;
	int y;
	string path;  //用来表示从起点到该点的最短路径 
};
queue<node> q;

bool check(int x, int y)
{
	if(x >= 1 && x <= m && y >= 1 && y <= n && !vis[x][y] && !e[x][y]) 
		return true;
	else 
		return false;
}

int main()
{
	char c;
	for(int i = 1; i <= m; i++)
	{
		for(int j = 1; j <= n; j++)
		{
			c = getchar();	
			e[i][j] = c - '0';  //表示此初是否有障碍 
		}
		c = getchar();  //需要用getchar()来读取一个换行符 
	}
	
	int newx, newy;
	node top, temp;  //定义结构体变量 
	temp.x = 1;  //定义起点 
	temp.y = 1;
	temp.path = "";
	q.push(temp);  //将起点放入队列中 
	vis[1][1] = true;
	string str = "DLRU";
	
	int cnx[4] = {1, 0, 0, -1};  //4个移动方向的坐标变化量 
	int cny[4] = {0, -1, 1, 0};
	
	while(!q.empty())  //队列为空时退出循环 
	{
		top = q.front();  //读取队列第一个变量，进行bfs遍历 
		q.pop();
		for(int i = 0; i < 4; i++)  //对于四个方向依次进行遍历 
		{
			newx = top.x + cnx[i];
			newy = top.y + cny[i];
			if(check(newx, newy))  //判断产生的新节点是否超出边界，是否在障碍物上，是否已被访问过 
			{
				temp.x = newx;
				temp.y = newy;
				temp.path = top.path + str[i];  //从起点到当前节点走过的路径 
				q.push(temp);
				vis[newx][newy] = true;  //标记当前节点已经被访问 
				
				if(newx == m && newy == n)  //到达终点 
				{
					cout << temp.path;  //输入路径 
					return 0;
				}
			}
		}
	}
	return 0;
}

输入数据：

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