迷宫-蓝桥602-bfs-2019省赛

最新推荐文章于 2025-05-16 08:17:19 发布

yyt_cdeyyds

最新推荐文章于 2025-05-16 08:17:19 发布

阅读量193

点赞数 3

文章标签：宽度优先 c++ 算法

本文链接：https://blog.youkuaiyun.com/yyt_cdeyyds/article/details/137695336

版权

本文介绍了一个使用C++编写的程序，通过广度优先搜索(BFS)算法解决迷宫问题，从起点到终点找到一条路径。程序中定义了节点结构、路径标记、方向向量以及访问标记数组，展示了如何遍历迷宫并输出到达终点的路径。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

代码

#include<iostream>
#include<queue>
using namespace std;

struct node{
	int x,y;
	string path;
};
char mp[31][51];
char k[]={'D','L','R','U'};//要走的路径标记
int dir[4][2]={{1,0},{0,-1},{0,1},{-1,0}};//wangleba
int vis[30][50];//记录走没走

void bfs(){
	node start;
	start.x=0,start.y=0,start.path="";//起点初始化
	vis[0][0]=1;
	queue<node> q;
	q.push(start);
	
	while(!q.empty()){
		node now=q.front();q.pop();
		
		if(now.x==29&&now.y==49)//设置结束条件
		{
			cout<<now.path;
			return;
		}
		for(int i=0;i<4;i++){
			//找到下一个点
			node next;
			next.x=now.x+dir[i][0];
			next.y=now.y+dir[i][1];
			//判断这个点能不能走:越界、走过、障碍
			if(next.x<0||next.x>29||next.y<0||next.y>49){
				continue;
			}
			if(vis[next.x][next.y]==1||mp[next.x][next.y]=='1'){
				continue;
			}
			//可走，就标记走了
			vis[next.x][next.y]=1;
			next.path=now.path+k[i];
			q.push(next);
		}
	}
}

int main(){
	for(int i=0;i<30;i++){
		for(int j=0;j<50;j++){
			cin>>mp[i][j];
		}
	}
	bfs();
	
	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
*/
/*
DDDDRRURRRRRRDRRRRDDDLDDRDDDDDDDDDDDDRDDRRRURRUURRDDDDRDRRRRRRDRRURRDDDRRRRUURUUUUUUULULLUUUURRRRUULLLUUUULLUUULUURRURRURURRRDDRRRRRDDRRDDLLLDDRRDDRDDLDDDLLDDLLLDLDDDLDDRRRRRRRRRDDDDDDRR

*/