题意:
孙悟空要去救唐僧;图中K是孙悟空,T是唐僧,S是蛇,数字是钥匙;
孙悟空必须拿到所有的钥匙,才能救唐僧,而且钥匙必须有顺序,你没拿到1,就不能拿2.
'#'不能走,走一步要花一个时间,经过S时,要花一个时间打蛇(蛇只要打一次,下次经过就不用打);
问最少的时间;
思路:
bfs;
用一个四维的vis,标记x,y蛇的状态,还有钥匙的状态;
蛇的状态用一个状态压缩,因为蛇最多5只,00000为初始值,一只蛇都还没杀,哪一只杀了,就把哪一位标记成1;
然后就是裸bfs();
把状态放进队列时,最好用优先队列,优先找步数最少的.这样可以保证,第一次出现满足条件的状态(到达'T',并且钥匙找够了)时,肯定步数最少,就可以直接返回了;
AC代码:
#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;
const int N = 105;
int vis[N][N][10][1 << 5];
int dir[4][2] = {{-1, 0},{1, 0},{0, 1},{0, -1}};
int sx, sy, m, snum;
char g[N][N];
int snak[N][N];
struct sta {
int x,y;
int key;
int snake;
int step;
bool operator< (sta a) const {
return this -> step > a.step;
}
}s,s1,s2;
priority_queue<sta> q;
int n,k;
void bfs() {
s.x = sx;
s.y = sy;
s.key = 0;
s.snake = 0;
s.step = 0;
vis[sx][sy][0][0] = 1;
q.push(s);
while(!q.empty()) {
s1 = q.top();
q.pop();
for(int i = 0; i < 4; i++) {
s2.x = s1.x + dir[i][0];
s2.y = s1.y + dir[i][1];
s2.step = s1.step + 1;
s2.snake = s1.snake;
s2.key = s1.key;
if(s2.x >= 0 && s2.y >= 0 && s2.x < n && s2.y < n && g[s2.x][s2.y] != '#' && !vis[s2.x][s2.y][s2.key][s2.snake]) {
vis[s2.x][s2.y][s2.key][s2.snake] = 1;
if(g[s2.x][s2.y] == 'S') {
if(!(s2.snake & (1 << snak[s2.x][s2.y]))) {
s2.snake |= (1 << snak[s2.x][s2.y]);
s2.step += 1;
}
q.push(s2);
}
else if(g[s2.x][s2.y] == s2.key + 1 + '0') {
s2.key += 1;
q.push(s2);
}
else if(g[s2.x][s2.y] == 'T' && s2.key == k) {
m = s2.step;
return ;
}
else {
q.push(s2);
}
}
}
}
}
int main() {
while(scanf("%d%d",&n,&k) && n) {
m = 0x3f3f3f3f;
snum = 0;
memset(vis, 0, sizeof(vis));
while(!q.empty())
q.pop();
for(int i = 0; i < n; i++) {
getchar();
for(int j = 0; j < n; j++) {
scanf("%c",&g[i][j]);
if(g[i][j] == 'K') {
sx = i;
sy = j;
}
if(g[i][j] == 'S') {
snak[i][j] = snum++;
}
}
}
bfs();
if(m != 0x3f3f3f3f)
printf("%d\n",m);
else
printf("impossible\n");
}
}