【蓝桥杯_真题演练】第十届C/C++省赛B组_E-迷宫（C++_bfs）

Problem

Process

这道题的数据量好大，刚开始用dfs写的，跑了5min没出答案我就知道完蛋了，所以换了bfs秒出结果…(后面附有dfs的代码，虽然跑不出这么大的数据，但是可以借鉴。)

Code

#include<bits/stdc++.h>//bfs
using namespace std;
int a[50][50], vis[50][50] = { 0 };
char b[5] = { 'R','L','U','D' };
int x[4] = { 0, 0, -1, 1 };
int y[4] = { 1, -1, 0, 0 };
int n, m;
string result;
struct node {
	int x, y;
	string str="";
	node(int a, int b, string c):x(a), y(b), str(c) {}
};
queue<node> q;
string bfs(int xx, int yy) {
	int flag = 0;
	q.push(node(xx, yy, ""));
	while (!q.empty()) {
		node temp = q.front();
		q.pop();
		for (int i = 0; i < 4; i++) {
			int xn = temp.x + x[i];
			int yn = temp.y + y[i];
			if (xn == n && yn == m)
			{
				flag = 1;
				temp.str += b[i];
				return temp.str;
			}
			if (vis[xn][yn] == 0 && xn >= 1 && xn <= n && yn >= 1 && yn <= m && a[xn][yn] == 0)
			{
				vis[xn][yn] = 1;
				string t = temp.str + b[i];
				q.push(node(xn, yn, t));
			}
		}
	}
}
int main()
{
	cin >> n >> m;
	for (int i = 1; i <= n; i++)
	{
		string str;
		cin >> str;
		for (int j = 1; j <= m; j++)
			a[i][j] = str[j - 1] - '0';
	}
	cout<<bfs(1, 1);
	return 0;
}

#include<bits/stdc++.h>//跑不出结果的dfs
using namespace std;
int a[50][50], b[5] = { 'R','L','U','D' }, vis[50][50] = {0};
int x[4] = { 0, 0, -1, 1 };
int y[4] = { 1, -1, 0, 0 };
int n, m;
string str="", result="";
void dfs(int xx, int yy) {
	if (xx == n && yy == m) {
		if ((str.size() < result.size() && str < result) || result == "")
			result = str;
		return;
	}
	else
		for (int i = 0; i < 4; i++)
		{
			int xn = xx + x[i];
			int yn = yy + y[i];
			if (vis[xn][yn] == 0 && xn >= 1 && xn <= n && yn >= 1 && yn <= m && a[xn][yn] == 0)
			{
				vis[xn][yn] = 1;
				str += b[i];
				dfs(xn, yn);
				vis[xn][yn] = 0;
				str = str.substr(0, str.size() - 1);
			}
		}
}
int main()
{
	cin >> n >> m;
	for (int i = 1; i <= n; i++)
	{
		string str;
		cin >> str;
		for (int j = 1; j <= m; j++)
			a[i][j] = str[j - 1] - '0';
	}
	dfs(1, 1);
	cout << result;
	return 0;
}

Result

DDDDRRURRRRRRRDRRRDDDLDDRDDDDDDDDDDDDRDRDRRURRUURRDDDDRDRRRRRRURRDRRDDDRRRRUURUUUUUUULULLUUUURRRRUULLLUUUULLUUULUURRURRURURRRDRDRRRRDRDRDDLLLDDRRDDRDDLDDDLLDDLLLDLDDDLDDRRRRRRRRRDDDDDDRR