HDOJ 1072 Nightmare (bfs)

原创 2012年03月24日 20:08:13

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搜索。

code:

#include <stdio.h>
int X1 = 0, Y1 = 0, X2 = 0, Y2 = 0, n = 0, m = 0, map[9][9], used[9][9];//用used记录上回走到这点的时间, 如果这回时间比上回少, 则更新used中的时间;
int dir[4][2] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}};
typedef struct
{
	int x,y,time,count;
}node;//count记录走过的步数,time记录时间。
node step, quene[100000];
void bfs()
{
	int i = 0, x = 0, y = 0, time = 0, fx = 0, fy = 0, front = 0, rear = 0, count = 0;
	quene[rear++] = step;
	while(front<rear)
	{
		x = quene[front].x; y = quene[front].y; time = quene[front].time; count = quene[front++].count;
		for(i = 0; i<4; i++)
		{
			fx = x+dir[i][0]; fy = y+dir[i][1];
			if(time+1<used[fx][fy] && fx>0 && fx<=n && fy>0 && fy<=m && map[fx][fy] != 0 && time<5)
			{
				if(map[fx][fy] == 3)//找到出口,输出。
				{
					printf("%d\n",count+1);
					return ;
				}
				if(map[fx][fy] == 4)//重设时间。
					step.time = 0;
				else
					step.time = time+1;
				step.x = fx; step.y = fy; step.count = count+1;
				used[fx][fy] = time+1;
				quene[rear++] = step;
			}
		}
	}
	printf("-1\n");
}
int main()
{
	int i = 0, j = 0, t = 0;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d %d",&n,&m);
		for(i = 1; i<=n; i++)
			for(j = 1; j<=m; j++)
			{
				scanf("%d",&map[i][j]);
				used[i][j] = 1234567890;
				if(map[i][j] == 2)
				{
					X1 = i; Y1 = j;
				}
				if(map[i][j] == 3)
				{
					X2 = i; Y2 = j;
				}
			}
		step.x = X1; step.y = Y1; step.time = 0; step.count = 0;
		bfs();
	}
	return 0;
}











                    

相关文章推荐

HDOJ1072 Nightmare(BFS,剪枝)

HDOJ1072 这道题可以剪枝: 剪枝说明:如果当前到达该点时间少于该点剩余时间并且步数大于该点步数,则返回. 剪枝说明:http://blog.csdn.net/iaccepted/arti...

hdoj1072 Nightmare(bfs寻找最短时间)

来源:http://acm.hdu.edu.cn/showproblem.php?pid=1072 创建了一个点的结构体point用来存储当前坐标和剩余时间及已花费的时间。 很重要的一点就是你得存...
  • CqZtw
  • CqZtw
  • 2017年06月08日 21:21
  • 107

HDOJ 1072 Nightmare(BFS)

Nightmare Problem Description Ignatius had a nightmare last night. He found himself in a labyri...

HDOJ/HDU 1072 Nightmare (bfs)

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1072 从入口到出口的最短路,4这个点要重置时间,不运行重复走,其他个点可以重复走,其中0是障碍,先前...

hdoj 1072 Nightmare 【bfs】

Nightmare Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Tota...

hdoj1072,Nightmare

1.利用广搜。看到求最小值就这样做了 2.不能标记已经走过的。原来标记了,但是后来去掉了。可以看到node里面还有布尔值,但是下面没有用 3.但是利用前后两个点的时间剩余比较来代替了。这样在题目给...

HDU1072 Nightmare(广搜BFS+优先队列)

题目: Nightmare Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Othe...

bfs-hdu-1072-Nightmare

#include #include #include #include using namespace std; int N,M,mt; int map[10][10]; struct node { ...

HDU1072 Nightmare (搜索算法)(DFS or BFS)

Nightmare Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total ...
  • sizaif
  • sizaif
  • 2017年03月01日 20:38
  • 107

HDU 1072 Nightmare - BFS + 队列

Nightmare Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Tota...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDOJ 1072 Nightmare (bfs)
举报原因:
原因补充:

(最多只允许输入30个字)