openjudge2.5基本算法之搜索——1159:Maze

原创 已于 2024-06-24 00:56:48 修改 · 754 阅读 · 13 ·
CC 4.0 BY-SA版权
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
文章标签：

#算法 #广度优先

于 2024-03-29 11:43:44 首次发布
文章讲述了Acm在特殊迷宫中的寻宝过程，需要找到所有门的钥匙才能打开通往宝藏的门。通过广度优先搜索算法判断Acm能否找到宝藏。

题目

`1159:Maze
描述
Acm, a treasure-explorer, is exploring again. This time he is in a special maze, in which there are some doors (at most 5 doors, represented by ‘A’, ‘B’, ‘C’, ‘D’, ‘E’ respectively). In order to find the treasure, Acm may need to open doors. However, to open a door he needs to find all the door’s keys (at least one) in the maze first. For example, if there are 3 keys of Door A, to open the door he should find all the 3 keys first (that’s three 'a’s which denote the keys of ‘A’ in the maze). Now make a program to tell Acm whether he can find the treasure or not. Notice that Acm can only go up, down, left and right in the maze.
输入
The input consists of multiple test cases. The first line of each test case contains two integers M and N (1 < N, M < 20), which denote the size of the maze. The next M lines give the maze layout, with each line containing N characters. A character is one of the following: ‘X’ (a block of wall,

最低0.47元/天 解锁文章
adam_life
关注
【算法练习】noi 1159:Maze
一蓑烟雨任平生
07-26 648
http://noi.openjudge.cn/ch0205/1159/ 题目： 1159:Maze 总时间限制:2000ms 内存限制:65536kB 描述 Acm, a treasure-explorer, is exploring again. This time he is in a special maze, in which there are some ...
openjudge2.5基本算法之搜索1253:Dungeon Master
adam_life的博客
04-03 868
openjudge2.5算法之搜索1253dungeon master
1159:Maze
lzx's blog
04-13 400
描述 Acm, a treasure-explorer, is exploring again. This time he is in a special maze, in which there are some doors (at most 5 doors, represented by ‘A’, ‘B’, ‘C’, ‘D’, ‘E’ respectively). In order to find the treasure, Acm may need to open doors. However, to
POJ 1159:Maze
Ctrl AC的博客
01-12 331
“ Ctrl AC！一起 AC！” 题目：忘题戳这 分析：可以用bfs，就是将可以走的路存入队列，遇到了门的话把它标记下，先不要开。先把所有能走到路走完，再去看能不能开门，能开门的话，把开门后扩展出的新路存入队列。继续重复该步骤，直到找到终点。队列全空了也找不到，说明无法达到终点。 AC代码： #include<iostream> #include<queue> #include<cstring> using namespace std; int dx[] =
OpenJudge NOI 2.5 1159:Maze
君义NOIP的博客
02-02 685
一个字符是以下几种情况之一：‘X’（一个表示墙的块，探险者不能进入），‘.’（一个空的块），‘S’（Acm的起始位置），‘G’（财宝位置）,‘A’, ‘B’, ‘C’, ‘D’, ‘E’（门），‘a’, ‘b’, ‘c’, ‘d’, ‘e’（门的钥匙）。例如，如果门A有三把钥匙，为了开门他需要先找到所有的三把钥匙（就是三个在迷宫中的表示门’A’钥匙的’a’），现在请写一个程序来告诉Acm他是否能够找到财宝。从该门的位置出发继续搜索它所在的整个连通块，更新钥匙数量以及可以接触到的门，再判断哪些门可以开启。
openjudge_2.5基本算法之搜索_7084:迷宫问题
adam_life的博客
06-04 907
openjudge_2.5基本算法之搜索_7084:迷宫问题
NOI - OpenJudge - 2.5基本算法之搜索 - 2753:走迷宫 - 超级无敌详细题解（含多个不同算法AC代码）
2301_76723927的博客
04-04 533
【代码】NOI - OpenJudge - 2.5基本算法之搜索 - 1490:A Knight‘s Journey - 超级无敌详细题解（含多个不同算法AC代码）
noi--1159:Maze(bfs)
神回
05-08 607
1159:Maze描述 Acm, a treasure-explorer, is exploring again. This time he is in a special maze, in which there are some doors (at most 5 doors, represented by ‘A’, ‘B’, ‘C’, ‘D’, ‘E’ respectively
POJ 2157 Maze
weixin_30588907的博客
07-21 194
Maze Time Limit:2000MS Memory Limit:65536K Total Submissions:3183 Accepted:996 Description Acm, a treasure-explorer, is exploring again. This time he is in a specia...
搜索专题 POJ 1159:Maze
xj13821328013的博客
09-07 407
代码越写越长，样例过了，提交却WA，找不出原因，先贴在这里吧 #include #include #include #include #include #include using namespace std; int n,m; int a1,b1,c1,d1,e1; int sx,sy,ex,ey; char ma[20][20]; bool mark[20][20]; int g
NOI OpenJudge 1159 Maze
Chlorineひかりのblog
10-15 782
描述 我知道你们不想看英语…. 输入 The input consists of multiple test cases. The first line of each test case contains two integers M and N (1 输出 For each test case, in one line output “YES” if Acm can find the
OpenJudge noi 1159Maze（poj 2157）
loi_black蒟蒻的博客
10-15 1401
Description Acm, a treasure-explorer, is exploring again. This time he is in a special maze, in which there are some doors (at most 5 doors, represented by ‘A’, ‘B’, ‘C’, ‘D’, ‘E’ respectively). In
英语题目翻译——OJ_1159:Maze
m0_64882565的博客
01-27 443
题目（1159:Maze） 翻译 Acm，一个寻宝者，正在再次探索。这次他是在一个特殊的迷宫,其中有一些门(最多5门,由“A”,' B ', ' C ', ' D ', ' E '分别表示)。为了找到宝藏，Acm需要打开大门。要打开一扇门，他需要先在迷宫中找到所有的钥匙(至少一个)。例如，如果有3把A的钥匙，要打开门，他应该先找到所有的3把钥匙(3个a表示迷宫中的A的钥匙)。请制作一个程序告诉Acm他是否能找到宝藏。注意,Acm只能在迷宫中上,下,左,右移动。 输入 输入包含多个测试实例。每个测试用
[POJ2157]Maze
dxyinme-Zz
01-25 541
Time Limit: 2000MS Memory Limit: 65536K Description Acm, a treasure-explorer, is exploring again. This time he is in a special maze, in which there are some doors (at most 5 doors, represented by ‘
poj 1159
水人的专栏
11-26 601
这题用short水过，一看网上大牛的代码，居然说可以用滚动数组！太厉害了。 //poj_1159 #include #include #define N 5010 #define INF 10000 #define hpmin(a,b) (a)<(b)?(a):(b) int n; char str[N]; short int dp[N][N]; int main() { int i, l
Poj2157Maze 搜索
weixin_30497527的博客
11-26 126
用一个5进制数来位压钥匙的状态，然后 判重就好了。 这题写戳了，反正是问能不能到，直接bfs 搜，打开一扇门在把它加入队列继续搜，看最后能不能搜到结果。 #include<stdio.h> #include<iostream> #include<algorithm> #include<string.h> #include<math...
搜索,Maze 题解
cosvae的博客
03-16 363
OPENJUDGE 1159:Maze 题目 描述 Acm, a treasure-explorer, is exploring again. This time he is in a special maze, in which there are some doors (at most 5 doors, represented by ‘A’, ‘B’, ‘C’, ‘D’, ‘E’ res...
Palindrome
02-01 473
http://poj.org/problem?id=1159 Description A palindrome is a symmetrical string, that is, a string read identically from left to right as well as from right to left. You are to write a progr
openjudge 2.5题解
最新发布
02-21
### 关于OpenJudge 2.5 题目的解题思路 #### The Castle (ybt 1250) 对于城堡问题，核心在于理解如何通过二进制表示墙壁的存在情况并利用搜索算法遍历连通区域。每个房间可以用一个整数描述其四面墙的状态，其中每一位代表一面墙是否存在。例如，北墙对应最低位，东墙次之，南墙再次，西墙最高位[^1]。 ```cpp #include <iostream> using namespace std; int main() { int w, h; cin >> w >> h; vector<vector<int>> room(h + 2, vector<int>(w + 2)); for(int i = 1; i <= h; ++i){ for(int j = 1; j <= w; ++j){ cin >> room[i][j]; } } // 定义方向数组用于移动 const int dx[] = {0, -1, 0, 1}; const int dy[] = {-1, 0, 1, 0}; function<void(int,int)> dfs = [&](int x, int y){ if(x < 1 || x > h || y < 1 || y > w) return; int walls = room[x][y]; room[x][y] |= 8; // 标记已访问 for(int d = 0; d < 4; ++d){ if((walls & (1 << ((d+2)%4))) == 0){ // 如果该方向无墙，则继续探索 dfs(x + dx[d], y + dy[d]); } } }; int areaCount = 0; for(int i = 1; i <= h; ++i){ for(int j = 1; j <= w; ++j){ if(room[i][j] < 8){ dfs(i, j); ++areaCount; } } } cout << "Number of rooms: " << areaCount << endl; } ``` 此代码实现了深度优先搜索(DFS)，用来计算不相连的房间数量。当遇到未被标记过的房间时启动一次新的DFS过程，并增加计数值。 #### Maze with Doors and Keys (OpenJudge NOI 2.5 1159) 针对带有门和钥匙的迷宫问题，解决方案涉及广度优先搜索(BFS)配合状态记录机制。由于存在多个可能影响路径的关键因素——即不同种类的门及其对应的钥匙，因此需要设计一种方式来追踪当前持有的钥匙集合以及已经解锁过哪些类型的门。可以采用队列存储节点信息的同时也保存这些额外的状态数据[^5]。 ```python from collections import deque def bfs(maze, start_pos): queue = deque([(start_pos, set())]) visited = {(start_pos, frozenset()): False} while queue: pos, keys = queue.popleft() r, c = pos # 边界条件检查... cell = maze[r][c] new_keys = keys.copy() if 'a' <= cell <= 'e': new_keys.add(cell.upper()) elif 'A' <= cell <= 'E' and cell not in keys: continue next_positions = [ (r-1,c), (r+1,c), (r,c-1), (r,c+1) ] for nr, nc in next_positions: if is_valid(nr,nc,maze): state = (nr, nc), frozenset(new_keys) if state not in visited or not visited[state]: visited[state] = True queue.append(((nr, nc), new_keys)) return all_doors_opened(keys) maze = [] for _ in range(rows): row_input = input().strip() maze.append(list(row_input)) print(bfs(maze, initial_position)) ``` 这段Python脚本展示了基本框架，实际应用中还需要补充边界验证逻辑(`is_valid`)和其他细节处理函数。
评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
红包 添加红包
表情包 插入表情
表情包 代码片
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值