《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).
大致题意:给出n*n的网格,有且只有一个K和一个T,最多有m把钥匙,最多 5条蛇,每走一格的时间为1,走到蛇的格子(杀蛇时间为1)的时间 为2(蛇不需要重复杀),取钥匙要按照顺序来 , 存在障碍格, 问能否从K到达T并收集所有钥匙,如果可以输出最短时间,否则输出impossible。
思路:
代码如下
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <queue>
#include <cstdio>
using namespace std;
#define ll long long int
const int INF=0x3f3f3f3f;
int dx[]={0,0,1,-1};
int dy[]={-1,1,0,0};
struct node
{
int x,y;//位置
int k,s,d;//当前取得的钥匙数,杀掉的蛇的状态,所花时间
};
int n,m;
int sn;
int sx,sy;
char a[105][105];
int vis[105][105][10][33];
queue<node> que;
int bfs()
{
while(!que.empty())
que.pop();
int ans=INF;
que.push((node){sx,sy,0,0,0});
while(!que.empty())
{
node q=que.front();
que.pop();
if(q.k==m&&a[q.x][q.y]=='T')//如果已经取得m把钥匙,并且到达T点
ans=min(ans,q.d);
if(vis[q.x][q.y][q.k][q.s]!=-1)//如果该种状态已经出现过
continue;
vis[q.x][q.y][q.k][q.s]=q.d;
for(int i=0;i<4;i++)
{
int xx=q.x+dx[i];
int yy=q.y+dy[i];
int st=a[xx][yy]-'A';
if(st>=0&&st<sn)//如果该位置是蛇
{
if((1<<st)&q.s)//如果已经打过
que.push((node){xx,yy,q.k,q.s,q.d+1});
else//如果没打过
que.push((node){xx,yy,q.k,q.s|(1<<st),q.d+2});
}
else
{
if(a[xx][yy]=='1'+q.k)//该位置有钥匙而且可以拿
que.push((node){xx,yy,q.k+1,q.s,q.d+1});
else if((a[xx][yy]>='1'&&a[xx][yy]<'1'+m)||a[xx][yy] == '.' || a[xx][yy] == 'K' || a[xx][yy] == 'T')//不能拿钥匙但该点可以走
que.push((node){xx,yy,q.k,q.s,q.d+1});
}
}
}
return ans;
}
int main()
{
while(1)
{
memset(vis,-1,sizeof(vis));
memset(a,0,sizeof(a));
scanf("%d%d",&n,&m);
if(!(n+m))
break;
sn=0;//蛇的数量
for(int i=1;i<=n;i++)
scanf("%s",a[i]+1);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
if(a[i][j]=='S')
{
a[i][j]='A'+sn;
sn++;
}
if(a[i][j]=='K')
{
sx=i;
sy=j;
}
}
int sum=bfs();
if(sum==INF)
printf("impossible\n");
else
printf("%d\n",sum);
}
return 0;
}