HDU 5025 Saving Tang Monk

Problem Description

《Journey to the West》(also 《Monkey》) is one of the Four Great Classical Novels of Chinese literature. It was written by Wu Cheng'en during the Ming Dynasty. In this novel, Monkey King Sun Wukong, pig Zhu Bajie and Sha Wujing, escorted Tang Monk to India to get sacred Buddhism texts.

During the journey, Tang Monk was often captured by demons. Most of demons wanted to eat Tang Monk to achieve immortality, but some female demons just wanted to marry him because he was handsome. So, fighting demons and saving Monk Tang is the major job for Sun Wukong to do.

Once, Tang Monk was captured by the demon White Bones. White Bones lived in a palace and she cuffed Tang Monk in a room. Sun Wukong managed to get into the palace. But to rescue Tang Monk, Sun Wukong might need to get some keys and kill some snakes in his way.

The palace can be described as a matrix of characters. Each character stands for a room. In the matrix, 'K' represents the original position of Sun Wukong, 'T' represents the location of Tang Monk and 'S' stands for a room with a snake in it. Please note that there are only one 'K' and one 'T', and at most five snakes in the palace. And, '.' means a clear room as well '#' means a deadly room which Sun Wukong couldn't get in.

There may be some keys of different kinds scattered in the rooms, but there is at most one key in one room. There are at most 9 kinds of keys. A room with a key in it is represented by a digit(from '1' to '9'). For example, '1' means a room with a first kind key, '2' means a room with a second kind key, '3' means a room with a third kind key... etc. To save Tang Monk, Sun Wukong must get ALL kinds of keys(in other words, at least one key for each kind).

For each step, Sun Wukong could move to the adjacent rooms(except deadly rooms) in 4 directions(north, west, south and east), and each step took him one minute. If he entered a room in which a living snake stayed, he must kill the snake. Killing a snake also took one minute. If Sun Wukong entered a room where there is a key of kind N, Sun would get that key if and only if he had already got keys of kind 1,kind 2 ... and kind N-1. In other words, Sun Wukong must get a key of kind N before he could get a key of kind N+1 (N>=1). If Sun Wukong got all keys he needed and entered the room in which Tang Monk was cuffed, the rescue mission is completed. If Sun Wukong didn't get enough keys, he still could pass through Tang Monk's room. Since Sun Wukong was a impatient monkey, he wanted to save Tang Monk as quickly as possible. Please figure out the minimum time Sun Wukong needed to rescue Tang Monk.

Input

There are several test cases.

For each case, the first line includes two integers N and M(0 < N <= 100, 0<=M<=9), meaning that the palace is a N×N matrix and Sun Wukong needed M kinds of keys(kind 1, kind 2, ... kind M).

Then the N × N matrix follows.

The input ends with N = 0 and M = 0.

Output

For each test case, print the minimum time (in minutes) Sun Wukong needed to save Tang Monk. If it's impossible for Sun Wukong to complete the mission, print "impossible"(no quotes).

Sample Input

3 1

K.S

##1

1#T

3 1

K#T

.S#

1#.

3 2

K#T

.S.

21.

0 0

Sample Output

impossible

题意

孙悟空要去救师傅，K代表起点，T为唐僧位置，S代表有蛇的房间（不会超过五条蛇），#为剧毒房间，无法进入带数字的房间为有钥匙的房间（不超过9个），孙悟空必须先拿到第一个钥匙，再拿第二个....最后拿到第m个钥匙，才能解救唐僧没有拿到第m个钥匙的时候可以路过但是不能解救唐僧，路过有蛇的房间的时候需要花一分钟杀蛇，杀掉之后再经过时就不用再花时间杀蛇，但是每经过一个房间需要花费一分钟，求就出唐僧最短的时间。

分析

由于杀蛇需要花费时间，所以不能是找到了唐僧就是最短时间，必须将所有的可能性取最小值，这是这道题和不同的bfs最大的不同，另外，需要一个五位二进制数来存目前杀蛇的情况（这样一个数就可以概括全部的五条蛇，当然我认为也可以用一个数组来存，但是太费空间）

下面是代码，直接看代码更容易理解

 1 #include <cstdio>2 #include <cstring>3 #include <algorithm>4 #include <iostream>5 #include <queue>6 using namespace std;7 #define N 1058 #define INF 0x3f3f3f3f9
10 struct node
11 {
12     int x, y, t, key, snake;
13     node() {}
14     node(int x, int y, int t, int key, int snake) : x(x), y(y), t(t), key(key), snake(snake) {}
15 };
16 bool vis[N][N][10][40];
17 int n, m, sx, sy, ex, ey;
18 int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1};
19 char maze[N][N];
20
21 bool check(int x, int y)
22 {
23     if(0<=x&&x<n&&0<=y&&y<n&&maze[x][y]!='#') return true;  //判断能不能走
24     return false;
25 }
26
27 void bfs()
28 {
29     int ans = INF;
30     memset(vis, 0, sizeof(vis));
31     queue<node> que;
32     while(!que.empty()) que.pop();     //清空队列 因为有多个测试
33     que.push(node(sx, sy, 0, 0, 0));
34     while(!que.empty()) {
35         node top = que.front(); que.pop();
36         int x = top.x, y = top.y, key = top.key, snake = top.snake, t = top.t;
37         if(key == m && maze[x][y] == 'T') {
38             ans = min(ans, t);      //取最短时间
39         }
40         if(vis[x][y][key][snake] != 0) continue;   //判断当前“状态”有没有访问过，注意是“状态”，不是房间，房间是可以重复访问的
41         vis[x][y][key][snake] = 1;
42         for(int i = 0; i < 4; i++) {
43             int nx = x + dx[i], ny = y + dy[i];
44             if(!check(nx, ny)) continue;
45             node now = top;
46             if('A' <= maze[nx][ny] && maze[nx][ny] <= 'G') {
47                 //只有五条蛇，不能写 <= 'Z'
48                 int s = maze[nx][ny] - 'A';
49                 if((1<<s) & now.snake) ; //如果蛇被打了
50                 else {
51                     now.snake |= (1<<s); //没被打，时间加1 记录打蛇情况
52                     now.t++;
53                 }
54             } else if(maze[nx][ny] - '0' == now
.key + 1) {
55                 now.key++;
56             }
57             now.t++;
58             que.push(node(nx, ny, now.t, now.key, now.snake));
59         }
60     }
61     if(ans != INF) printf("%d\n", ans);
62     else printf("impossible\n");
63 }
64
65 int main()
66 {
67     while(~scanf("%d%d", &n, &m), n+m) {
68         int cnt = 0;
69         for(int i = 0; i < n; i++) {
70             scanf("%s", maze[i]);
71         }
72         for(int i = 0; i < n; i++) {
73             for(int j = 0; j < n; j++) {
74                 if(maze[i][j] == 'K') sx = i, sy = j;
75                 if(maze[i][j] == 'S') {maze[i][j] = cnt+'A'; cnt++;}
76             }
77         }
78         bfs();
79     }
80     return 0;
81 }

转载于:https://www.cnblogs.com/dyhaohaoxuexi/p/10629672.html

HDU 5025 Saving Tang Monk相关推荐

HDU 5025 Saving Tang Monk（广州网络赛D题）
HDU 5025 Saving Tang Monk 题目链接思路:记忆化广搜,vis[x][y][k][s]表示在x, y结点,有k把钥匙了,蛇剩余状态为s的步数,先把图预处理出来,然后进行广搜即可 ...
2014 网选广州赛区 hdu 5025 Saving Tang Monk（bfs+四维数组记录状态）
1 /* 2 这是我做过的一道新类型的搜索题!从来没想过用四维数组记录状态! 3 以前做过的都是用二维的!自己的四维还是太狭隘了..... 4 5 题意:悟空救师傅 ! 在救师父之前要先把所有的钥匙找 ...
HDU 5025：Saving Tang Monk（BFS + 状压）
http://acm.hdu.edu.cn/showproblem.php?pid=5025 Saving Tang Monk Problem Description <Journey to t ...
Saving Tang Monk II HihoCoder - 1828（2018北京网络赛三维标记+bfs）
<Journey to the West>(also <Monkey>) is one of the Four Great Classical Novels of Chines ...
ACM/ICPC 2018亚洲区预选赛北京赛站网络赛 A Saving Tang Monk II【分层bfs】
时间限制:1000ms 单点时限:1000ms 内存限制:256MB 描述 <Journey to the West>(also <Monkey>) is one of the ...
#hihoCoder #1828 : Saving Tang Monk II （分层BFS）
描述 <Journey to the West>(also <Monkey>) is one of the Four Great Classical Novels of Chi ...
hihoCoder-1828 2018亚洲区预选赛北京赛站网络赛 A.Saving Tang Monk II BFS
题面题意:N*M的网格图里,有起点S,终点T,然后有'.'表示一般房间,'#'表示毒气房间,进入毒气房间要消耗一个氧气瓶,而且要多停留一分钟,'B'表示放氧气瓶的房间,每次进入可以获得一个氧气瓶,最 ...
HihoCoder - 1828 Saving Tang Monk II(bfs+动态规划/bfs+优先队列)
题目链接:点击查看题目大意:孙悟空要走迷宫去救唐僧,给出n和m约束迷宫大小: 迷宫中: S代表起点 T代表终点 B代表氧气区,经过可以获得一罐氧气,最多储存5罐氧气 #代表毒气区,经过需要花费2个时 ...
ACM/ICPC 2018亚洲区预选赛北京赛站网络赛 A. Saving Tang Monk II
题解题目大意给一个图S是起点 T是终点 .是空房间 #是毒气室 B是氧气瓶存放室 P是加速室每次走到空房间或者起点消耗1秒走到氧气室获得一个氧气瓶最多携带5个氧气瓶进入毒气室需要一瓶氧气并且 ...
2018年 ICPC北京网络预选赛 A题 Saving Tang Monk II
由于个人比较菜啊,这道题错了4次才ac,思路是对的,就是各种死在细节上. 题目大意:唐僧给妖精抓走了,悟空要去救出唐僧,给你一个地图长N高M,'S'表示悟空所在地,'T' 表示唐僧所在地,'.'i表示 ...

HDU 5025 Saving Tang Monk

HDU 5025 Saving Tang Monk相关推荐

最新文章

热门文章