Given the layout of the labyrinth and Ignatius' start position, please tell Ignatius whether he could get out of the labyrinth, if he could, output the minimum time that he has to use to find the exit of the labyrinth, else output -1.
Here are some rules:
1. We can assume the labyrinth is a 2 array.
2. Each minute, Ignatius could only get to one of the nearest area, and he should not walk out of the border, of course he could not walk on a wall, too.
3. If Ignatius get to the exit when the exploding time turns to 0, he can't get out of the labyrinth.
4. If Ignatius get to the area which contains Bomb-Rest-Equipment when the exploding time turns to 0, he can't use the equipment to reset the bomb.
5. A Bomb-Reset-Equipment can be used as many times as you wish, if it is needed, Ignatius can get to any areas in the labyrinth as many times as you wish.
6. The time to reset the exploding time can be ignore, in other words, if Ignatius get to an area which contain Bomb-Rest-Equipment, and the exploding time is larger than 0, the exploding time would be reset to 6.
Input
The input contains several test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow.
Each test case starts with two integers N and M(1<=N,Mm=8) which indicate the size of the labyrinth. Then N lines follow, each line contains M integers. The array indicates the layout of the labyrinth.
There are five integers which indicate the different type of area in the labyrinth:
0: The area is a wall, Ignatius should not walk on it.
1: The area contains nothing, Ignatius can walk on it.
2: Ignatius' start position, Ignatius starts his escape from this position.
3: The exit of the labyrinth, Ignatius' target position.
4: The area contains a Bomb-Reset-Equipment, Ignatius can delay the exploding time by walking to these areas.
Output
For each test case, if Ignatius can get out of the labyrinth, you should output the minimum time he needs, else you should just output -1.
Sample Input
3 3 3 2 1 1 1 1 0 1 1 3 4 8 2 1 1 0 1 1 1 0 1 0 4 1 1 0 4 1 1 0 0 0 0 0 0 1 1 1 1 4 1 1 1 3 5 8 1 2 1 1 1 1 1 4 1 0 0 0 1 0 0 1 1 4 1 0 1 1 0 1 1 0 0 0 0 3 0 1 1 1 4 1 1 1 1 1
Sample Output
4 -1 13
代码:
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<queue>
using namespace std;
struct point
{
int x;
int y;
int time; //炸弹时间
int alltime; //所用时间
point(){
}
point(int xx,int yy,int tt,int aa):x(xx),y(yy),time(tt),alltime(aa){
}
};
int main(void)
{
int t,m,n;
scanf("%d",&t);
while(t--)
{
scanf("%d %d",&n,&m);
int i,j;
queue<point> q,qq;
point exit;
vector<vector<int> >arr(20,vector<int>(20,0)); //二维数组清0
vector<vector<int> >in(20,vector<int>(20,0));
for(i=0;i<20;i++)
{
for(j=0;j<20;j++)
{
arr[i][j]=0;
in[i][j]=0;
}
}
while(q.size())
q.pop();
while(qq.size())
qq.pop();
int dx[4]={1,0,-1,0}; //方向数组
int dy[4]={0,1,0,-1};
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
scanf("%d",&arr[i][j]);
if(arr[i][j]==2)
{
qq.push(point(i,j,6,0)); //入口
in[i][j]=1;
}
else if(arr[i][j]==3) //出口
{
exit.x=i;
exit.y=j;
}
}
}
while(qq.size()) //双重广搜
{
while(q.size())
q.pop();
q.push(qq.front());
qq.pop();
for(i=0;i<20;i++)
{
for(j=0;j<20;j++)
{
in[i][j]=0;//重新清0
}
}
while(q.size()) //
{
point now=q.front();
if(now.x==exit.x&&now.y==exit.y)
{
break;
}
q.pop();
for(i=0;i<4;i++) //枚举四个方向
{
int xx=dx[i]+now.x;
int yy=dy[i]+now.y;
if(arr[xx][yy]&&!in[xx][yy]&&now.time-1>0) // 判断下一步是否满足条件
{
if(arr[xx][yy]==4)
{
q.push(point(xx,yy,6,now.alltime+1));
qq.push(point(xx,yy,6,now.alltime+1));//从当前点开始新一轮广搜
arr[xx][yy]=1;
in[xx][yy]=1;
}
else
{
q.push(point(xx,yy,now.time-1,now.alltime+1));
in[xx][yy]=1;
}
}
}
}
}
if(q.size())
printf("%d\n",q.front().alltime);
else
printf("-1\n");
}
return 0;
}