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;
}











                    

杭电1072——Nightmare(BFS)

Problem Description Ignatius had a nightmare last night. He found himself in a labyrinth with a ti...
  • qianchangdiyin
  • qianchangdiyin
  • 2016年02月01日 15:55
  • 131

HDU1072-Nightmare【广度优先搜索】

Nightmare Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Tota...
  • u013517797
  • u013517797
  • 2014年08月02日 09:35
  • 1245

HDU 1072 Nightmare 【BFS (路径可重复使用)】

Nightmare Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total ...
  • u013806814
  • u013806814
  • 2014年12月12日 23:06
  • 427

杭电OJ 1072图搜 Nightmare(bfs)(图搜)

Nightmare Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Tota...
  • mengxiang000000
  • mengxiang000000
  • 2015年12月24日 11:49
  • 492

poj3984迷宫问题【bfs+记录路径】

迷宫问题 Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 11236   Accepted...
  • R1986799047
  • R1986799047
  • 2015年08月06日 10:16
  • 739

Nightmare(暴力剪枝BFS)

Link:点击打开链接 problem: Nightmare Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65...
  • Enjoying_Science
  • Enjoying_Science
  • 2014年09月22日 23:36
  • 639

BFS:Nightmare(可返回路径)

解题心得: 1、point:关于可以返回路径的BFS的标记方法,并非是简单的0-1,而是可以用时间比较之后判断是否push。 2、queue创建的地点(初始化问题),在全局中创建queue在一次调...
  • yopilipala
  • yopilipala
  • 2017年02月06日 11:36
  • 396

Nightmare之BFS解题报告

Nightmare Time Limit: 2000/1000 MS(Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total...
  • caizi1991
  • caizi1991
  • 2013年05月23日 11:34
  • 411

hdu 1072(倒计时bfs)

题意: 你手上有一个炸弹,6分钟后会爆炸,现在给你一张图,你走到出口时炸弹没有爆炸你就安全了。 图上有很多重设时间点,走到重设时间点可以把时间重新设置为6分钟,你可以走上下左右四个方向,每走一步消...
  • u013508213
  • u013508213
  • 2015年04月26日 13:59
  • 250

hdoj 1728 逃离迷宫 【BFS 记录转弯次数】

逃离迷宫 Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Sub...
  • chenzhenyu123456
  • chenzhenyu123456
  • 2015年08月05日 20:15
  • 649
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDOJ 1072 Nightmare (bfs)
举报原因:
原因补充:

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