Nightmare（暴力剪枝BFS）

Link：点击打开链接

problem：

Nightmare

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7319    Accepted Submission(s): 3514

Problem Description

Ignatius had a nightmare last night. He found himself in a labyrinth with a time bomb on him. The labyrinth has an exit, Ignatius should get out of the labyrinth before the bomb explodes. The initial exploding time of the bomb is set to 6 minutes. To prevent the bomb from exploding by shake, Ignatius had to move slowly, that is to move from one area to the nearest area(that is, if Ignatius stands on (x,y) now, he could only on (x+1,y), (x-1,y), (x,y+1), or (x,y-1) in the next minute) takes him 1 minute. Some area in the labyrinth contains a Bomb-Reset-Equipment. They could reset the exploding time to 6 minutes.

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
  
  

 

Author

Ignatius.L

code：

#include<iostream>
#include<queue>
#include<algorithm>
using namespace std;
int map[8][8],n,m;
int d[4][2]={{-1,0},{0,-1},{1,0},{0,1}};
struct node{
int x;
int y;
int step;
int t;
};
node st,ed;
int bfs()
{
queue<node>Q;
int i,xi,yi,ti;
node now,next;
now=st;
Q.push(now);
while(!Q.empty())
{
now=Q.front();
Q.pop();
for(i=0;i<4;i++)
{
xi=d[i][0]+now.x;
yi=d[i][1]+now.y;
ti=now.t-1;
if(xi>=0&&xi<n&&yi>=0&&yi<m&&ti>0&&map[xi][yi]!=0)
{
if(map[xi][yi]==3)
return now.step+1;
else if(map[xi][yi]==4)
{
map[xi][yi]=0;
next.t=6;
}
else
next.t=ti;
next.step=now.step+1;
next.x=xi;
next.y=yi;
Q.push(next);
}
}
}
return -1;
}
int main()
{
int cas,i,j;
while(scanf("%d",&cas)!=EOF)
{
while(cas--)
{
scanf("%d%d",&n,&m);
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
scanf("%d",&map[i][j]);
if(map[i][j]==2)
{
st.x=i;
st.y=j;
st.step=0;
st.t=6;
}
else if(map[i][j]==3)
{
ed.x=i;
ed.y=j;
}
}
}
printf("%d\n",bfs());
}
}
return 0;
}

参考网上总结：一般bfs时一点入队后就把这点记为已搜索过，但这题因为每一点‘1’可以走多次所以不能如一般做法去做，可根据前后两次踏


           上同一位置是bomb离explode的时间长短来标记。而只要进入位置4，那么bomb就会延时到6分钟，最大的延时时间。换句话说，下次再进入该4位置，也


             不会获得更大的延时时间了。所以，只要访问过位置4了，就可以直接标记为0位置，表明下次不可在访问。所以后来我只把走到4时标记。