Nightmare BFS

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

前面两个是WA

由于这道题允许重复走似乎就不用设立book 或INF标记是否走过了 ；
两个剪枝的条件：

1. 时间少于2 秒时 不考虑
2. 在重置时间后 将Bomb-Reset-Equipment 设为不可走 即“0”

总结一下：
之前一直使用C 语言打BFS的；
嗯嗯 然后用queue写 十分开心

#include<cstdio>
#include<algorithm>
#include<cstring > 
using namespace std;

int map[20][20],book[20][20],head,tail,m,n,sx,sy;
struct note{
	int x;
	int y;
	int sj;
	int sy;
	int bz;
};
int main(){
	int next[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
	int i,j;
	int T;
	scanf("%d",&T);
	while(T--){
		int min=99999999;
		int flag=1;
		note que[120];
		memset(book,0,sizeof(book));
		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) {
					sx=i;
					sy=j;
				}
		
			}
		}
		head=tail=0;
		que[tail].x=sx;
		que[tail].y=sy;
		que[tail].sy=6;
		tail++;
		int tx,ty;
		 while(head<tail){
		 	while(que[head].sy<2 ) {
		 		head++;
			 }
		 	for(i=0;i<4;i++){
		 		tx=que[head].x +next[i][0];
		 		ty=que[head].y +next[i][1];
		 		if(tx<0||tx>=n||ty<0||ty>=m||(book[tx][ty]==1&&que[head].bz ==0)||map[tx][ty]==0) continue;
		 	
			    if (book[tx][ty]==1&&que[head].bz )que[tail].bz=que[head].bz +1;
				if(que[tail].bz >6)  que[tail].bz=0;
				book[tx][ty]=1;
		 		que[tail].x=tx;
		 		que[tail].y=ty;
		 		que[tail].sj =que[head].sj+1;
		 		que[tail].sy =que[head].sy-1;
		 		
		 		if(map[tx][ty]==4) que[tail].sy =6;
		 		if(map[tx][ty]==3&&que[tail].sj<min) {
		 			min=que[tail].sj ;
		 			flag=0;
				 }
		 		else  tail++;
			 }
			 head++;
		 }
		if(flag) printf("-1\n");
		else printf("%d\n",min);
		
	}
	return 0;
}

#include<cstdio>
#include<queue>
#include<algorithm>
using namespace std;
struct note{
	int x;
	int y;
	int sy;
	int step;
	
};
int main(){
	int T;
	int m,n;
	int next[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
	scanf("%d",&T);
	while(T--){
		note  w,mm;
		queue<note> que;
		int m,n,map[10][10];
		scanf("%d%d",&m,&n);
		for(int i=0;i<m;i++){
			for(int j=0;j<n;j++){
				scanf("%d",&map[i][j]);
				if(map[i][j]==2){
				w.x =i;
				w.y =j;
				w.step =0;
				w.sy =6;
				}
			}
		}
	que.push(w);
	int ans=0;
	while(que.size()){
		note temp;
		mm=que.front();
		que.pop();
		if(mm.sy <2) continue;
		int tx,ty;
		for(int i=0;i<4;i++){
			tx=mm.x +next[i][0];
			ty=mm.y +next[i][1];
			
		
		if(tx<0||tx>=m||ty<0||ty>=n||map[tx][ty]){
			continue;
		}
		temp.x =tx;
		temp.y =ty;
		temp.sy =mm.sy -1;
		temp.step =mm.step +1;
		if(map[tx][ty]==4){
			map[tx][ty]=0;
			temp.sy =6;
			
		}
		que.push(temp);
		if(map[tx][ty]==3){
			ans=temp.step ;
			break;
			
		}
		
		}
		if(ans) break;
	}
	if(!ans){
		printf("-1\n");
		}else printf("%d\n",ans);	
	}
	return 0;
}

突然发现错误是那个判断语句

		if(tx<0||tx>=m||ty<0||ty>=n||!(map[tx][ty])){
			continue;
		}

AC

#include<cstdio>
#include<queue>
#include<algorithm>
using namespace std;
struct note{
	int x;
	int y;
	int sy;
	int step;
	
};
int main(){
	int T;
	int m,n;
	int next[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
	scanf("%d",&T);
	while(T--){
		note  w,mm;
		queue<note> que;
		int m,n,map[10][10];
		scanf("%d%d",&m,&n);
		for(int i=0;i<m;i++){
			for(int j=0;j<n;j++){
				scanf("%d",&map[i][j]);
				if(map[i][j]==2){
				w.x =i;
				w.y =j;
				w.step =0;
				w.sy =6;
				}
			}
		}
	que.push(w);
	int ans=0;
	while(que.size()){
		note temp;
		mm=que.front();
		que.pop();
		if(mm.sy <2) continue;
		int tx,ty;
		for(int i=0;i<4;i++){
			tx=mm.x +next[i][0];
			ty=mm.y +next[i][1];
			
		
		if(tx>=0&&tx<m&&ty>=0&&ty<n&&map[tx][ty]){
			temp.x =tx;
		temp.y =ty;
		temp.sy =mm.sy -1;
		temp.step =mm.step +1;
		if(map[tx][ty]==4){
			map[tx][ty]=0;
			temp.sy =6;
			
		}
		que.push(temp);
		if(map[tx][ty]==3){
			ans=temp.step ;
			break;
			
		}	
		}
	
		
		}
		if(ans) break;
	}
	if(!ans){
		printf("-1\n");
		}else printf("%d\n",ans);	
	}
	return 0;
}