HDU 1072 Nightmare(BFS)（注：不标记每个节点四方向累计4次剪枝）

Nightmare

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

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
   
   
   
   
   
   
   
   


   
   
   
   
   
   
   
   

    
    
    
    //BFS果然是求最小步数的  dfs就超   每个节点来回四方向进过 即累计4次就肯定不对  剪掉
   
   
   
   
   
   
   
   

    
    
    
    //AC
   
   
   
   
   
   
   
   

    
    
    
    
#include <iostream>
#include <cstdio>
#include <queue> 
using namespace std;
const int N=10;
int map[N][N];
bool ok;
int n,m;
int book[N][N];
int step[4][2]={{0,1},{1,0},{-1,0},{0,-1}};
struct Node{
	int x,y,step,bomb;
}tmp,node;
queue<Node> q;

int main(){
	int t,i,j;
	scanf("%d",&t);
	while(t--){
		ok=0;
		while(!q.empty()) q.pop();
 	    scanf("%d%d",&n,&m);
		for(i=0;i<n;i++)
		for(j=0;j<m;j++){
			book[i][j]=0;
			scanf("%d",&map[i][j]);
			if(map[i][j]==2){
				node.x=i;
				node.y=j;
				node.bomb=0;
				node.step=0;
			}
		}
		q.push(node);
		while(!q.empty()){
		    node=q.front();
			q.pop();
			if(node.bomb>=6)
			  continue;
			if(map[node.x][node.y]==3)
			  {
			  	ok=1;
			  	break;
			 }	
		 else if(map[node.x][node.y]==4)
			     node.bomb=0;		
	 for(i=0;i<4;i++){
		int a=node.x+step[i][0];
		int b=node.y+step[i][1];
		if(a<0||a>=n||b<0||b>=m||map[a][b]==0||book[node.x][node.y]>4)
		continue;
		 tmp.x=a;
		 tmp.y=b;
		 tmp.step=node.step+1;
		 tmp.bomb=node.bomb+1;
		book[a][b]++;
		 q.push(tmp);
	}	
}
		if(ok)
		printf("%d\n",node.step);
		else
		printf("-1\n");
	}
	return 0;
}
/*超时 
#include <iostream>
#include <cstdio>
using namespace std;
const int N=10;
int map[N][N];
bool ok;
int n,m,small;
int book[N][N];
int step[4][2]={{0,1},{1,0},{-1,0},{0,-1}};
void dfs(int x,int y,int sum,int bomb){
	if(bomb>=6||sum>=small)
	return ;
	if(map[x][y]==3){
		ok=1;
		if(sum<small)
		small=sum;
		return;
	}
	if(map[x][y]==4)
		bomb=0;	  
	int i;
	for(i=0;i<4;i++){
		int a=x+step[i][0];
		int b=y+step[i][1];
		if(a<0||a>=n||b<0||b>=m||map[a][b]==0)
		continue;
		//book[a][b]++;
          dfs(a,b,sum+1,bomb+1);
		//book[a][b]--;
	}
}
int main(){
	int t,i,j,bx,by;
	scanf("%d",&t);
	while(t--){
		small=99999999;
		ok=0;
	    scanf("%d%d",&n,&m);
		for(i=0;i<n;i++)
		for(j=0;j<m;j++){
		//	book[i][j]=0;
			scanf("%d",&map[i][j]);
			if(map[i][j]==2){
				bx=i;
				by=j;
			}
		}
	  // 	book[bx][by]++;
		dfs(bx,by,0,0);
		if(ok)
		printf("%d\n",small);
		else
		printf("-1\n");
	}
	return 0;
}
*/