题目大意:给定n*n的网络,起点K,终点T,S表示蛇(最多5条,且经过S时,若蛇是活的则时间+1),数字代表钥匙编号(最多m把且必须按照顺序取),每次移动时间+1,求集齐所有钥匙到达终点的最短时间
bfs迷宫搜索。
vis记录状态:行,列,蛇是否存活,钥匙的集齐情况。每个状态只被入队一次。
#include <cstdio>
#include <queue>
#include <cstring>
using namespace std;
const int INF = 0x3f3f3f3f;
const int N = 110;
struct node
{
int r, c, s, key, t;
node(){}
node(int _r,int _c,int _s,int _key,int _t)
:r(_r),c(_c),s(_s),key(_key),t(_t){}
};
bool vis[N][N][1<<5][10];
char a[N][N];
int n, m;
int dr[4] = {-1,1,0,0};
int dc[4] = {0,0,-1,1};
int bfs(int srow, int scol)
{
int ret = INF;
memset(vis, 0, sizeof(vis));
queue <node> q;
q.push(node(srow,scol,0,0,0));
while(!q.empty())
{
node u = q.front();
q.pop();
int r=u.r, c=u.c, s=u.s, key=u.key, t=u.t;
if(key==m && a[r][c]=='T') ret = min(ret, t);//在出队时判定终点
vis[r][c][s][key] = 1;
for(int i = 0; i < 4; ++i)
{
node v = node(u.r+dr[i],u.c+dc[i],u.s,u.key,u.t);
if(v.r<1 || v.r>n || v.c<1 || v.c>n) continue;
if(a[v.r][v.c]=='#' || vis[v.r][v.c][v.s][v.key]) continue;//每个状态只入队一次
if(a[v.r][v.c]>='A' && a[v.r][v.c]<='G')
{//只处理特殊情况
int x = a[v.r][v.c]-'A';
if(!((1<<x)&v.s))
{
v.s |= (1<<x);
++v.t;
}
}
else if(a[v.r][v.c]-'0'==v.key+1)
++v.key;
++v.t;
vis[v.r][v.c][v.s][v.key] = 1;//打vis标机并入队
q.push(node(v.r,v.c,v.s,v.key,v.t));
}
}
return ret;
}
int main()
{
while(~scanf("%d %d", &n, &m) && (n||m))
{
for(int i = 1; i <= n; ++i)
scanf("%s", a[i]+1);
int srow, scol;
int tot = 0;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
if(a[i][j]=='K')
{
srow = i;
scol = j;
}
else if(a[i][j]=='S')
{
a[i][j] = tot+'A';
++tot;
}
int ans = bfs(srow, scol);
if(ans==INF) printf("impossible\n");
else printf("%d\n", ans);
}
return 0;
}