噩梦

最新推荐文章于 2022-09-22 23:33:38 发布

姚希瑶

最新推荐文章于 2022-09-22 23:33:38 发布

阅读量185

点赞数

描述：

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.

Input

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

中文描述：

Ignatius昨晚有一场噩梦。他发现自己在一个迷宫里，对他进行定时炸弹。迷宫有一个出口，Ignatius应该在炸弹爆炸之前离开迷宫。炸弹的最初爆炸时间设定为6分钟。为了防止炸弹爆炸，Ignatius不得不缓慢移动，即从一个地区移动到最近的地区（即，如果Ignatius现在站在（x，y）上，他只能在（x + 1， y），（x-1，y），（x，y + 1）或（x，y-1）需要1分钟。迷宫中的一些区域包含一个炸弹重置设备。他们可以将爆炸时间重置为6分钟。

鉴于迷宫和Ignatius的起始位置的布局，请告诉Ignatius是否可以离开迷宫，如果可以，输出他必须使用的最短时间才能找到迷宫的出口，否则输出-1。

这里有一些规则：
1.我们可以假设迷宫是一个2阵列。
每一分钟，Ignatius只能到达最近的一个地区，他不应该走出边界，当然他也不能在墙上走。
3.如果Ignatius在爆炸时间变为0时到达出口，则无法离开迷宫。
4.如果Ignatius在爆炸时间变为0时进入包含炸弹休息设备的区域，则不能使用设备重置炸弹。
5.炸弹重置设备可以根据需要多次使用，如果需要，Ignatius可以按需要多次进入迷宫中的任何地方。
6.重置爆炸时间的时间可以忽略，换句话说，如果Ignatius到达包含Bomb-Rest-Equipment的区域，并且爆炸时间大于0，则爆炸时间将重置为6。

输入

该输入包含几个测试用例。输入的第一行是单个整数T，它是测试用例的数量。T测试案例如下。
每个测试用例从两个整数N和M（1 <= N，Mm = 8）开始，表示迷宫的大小。然后按N行，每行包含M个整数。阵列指示迷宫的布局。
有五个整数表示迷宫中不同类型的区域：
0：该区域是墙壁，Ignatius不应该在其上行走。
1：该地区没有任何东西，Ignatius可以走上去。
2：Ignatius的起始位置，Ignatius从这个位置开始逃脱。
3：迷宫的出口，Ignatius的目标位置。
4：该区域包含一个炸弹重置设备，Ignatius可以通过步行到这些区域来延迟爆炸时间。

产量

对于每个测试用例，如果Ignatius可以离开迷宫，您应该输出所需的最短时间，否则您应该输出-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 
    
    
    
    

    
    
    
    

    
    
    
    

    
    
    
    

     
     #include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;


class Data
{
public:
	int Etime;
	int x, y;
	int count;
};


int n, m, sx, sy;
int map[9][9];
int direction[4][2] = {1, 0, -1, 0, 0, 1, 0, -1};


int bfs()                       //广度搜索
{
	int i;
	int tx, ty;
	queue<Data> Que;
	while(!Que.empty())
	{
		Que.pop();
	}
	Data Da, temp;
	Da.x = sx; Da.y = sy;
	Da.Etime = 6; Da.count = 0;
	Que.push(Da);                       //起点入队
	while(!Que.empty())
	{
		temp = Que.front();
		Que.pop();
		if(map[temp.x][temp.y] == 3)  //到了终点
			return temp.count;
		if(temp.Etime == 1)           //没到终点，时间变成1，下一步之后，时间变0，无论怎么走，都没时间了，直接跳过
			continue;             //忽略掉时间为0的，下面的引爆就不用判断时间
		for(i = 0; i < 4; i++)        //四个方向搜索
		{
			tx = temp.x + direction[i][0];
			ty = temp.y + direction[i][1];
			if(tx < 0 || tx >= n || ty < 0 || ty >= m || map[tx][ty] == 0)
				continue;
	
			Da.x = tx; Da.y = ty; Da.Etime = temp.Etime - 1; Da.count = temp.count + 1;	
			if(map[tx][ty] == 4)          //引爆，重置时间
			{
				Da.Etime = 6;
				map[tx][ty] = 0;
			}
			Que.push(Da);
		}
	}
	return -1;
}


int main()
{
//	freopen("data.txt", "r", stdin);
	int T, i, j;
	while(scanf("%d", &T) != EOF)
	{
		while(T--)
		{
			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;
					}
				}
			int ans = bfs();
			cout << ans << endl;
		}
	}
	return 0;
}

Input

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

姚希瑶

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
噩梦

描述：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
复制链接

扫一扫