HDU 1072Nightmare(dfs+剪枝)
来源:互联网 发布:kettle java jndi 编辑:程序博客网 时间:2024/06/05 23:07
Nightmare
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 1 Accepted Submission(s) : 1
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
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.
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.
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
33 32 1 11 1 01 1 34 82 1 1 0 1 1 1 01 0 4 1 1 0 4 11 0 0 0 0 0 0 11 1 1 4 1 1 1 35 81 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-113
Author
阅读全文
0 0
- HDU 1072Nightmare(dfs+剪枝)
- hdu-1072 Nightmare(DFS+剪枝)
- hdu 1072 Nightmare dfs+剪枝
- HDU 1072 Nightmare(DFS或BFS+剪枝)
- hdu Nightmare(BFS||DFS)(不标记的剪枝)
- HDU 1072Nightmare(BFS+剪枝)
- hdu 1072 Nightmare(DFS)
- hdu 1072 Nightmare(dfs)(转)
- HDU 1072 Nightmare(搜索-DFS)
- 搜索专题(DFS)HDU 1072-Nightmare
- HDU 1072 Nightmare(搜索-DFS)
- HDU 1728 逃离迷宫 + HDU 1072 Nightmare(bfs+dfs)
- hdu 1072 Nightmare(BFS法和DFS法)
- HDOJ 1072 Nightmare (DFS)
- Nightmare(HDU 1072)
- hdu 1010 (DFS+剪枝)
- hdu 1455 (DFS+剪枝)
- HDU 1072 Nightmare(BFS)(注:不标记每个节点四方向累计4次剪枝)
- nginx学习随笔--ssl_session_timeout
- 消息代理 RabbitMQ 一、概念简介
- 7
- 2017秋招-技术岗-海能达-Java开发(2轮)
- 10 个最基本的JS面试问题及答案
- HDU 1072Nightmare(dfs+剪枝)
- Java集合类详解
- HTML5新增块级元素
- JDK环境变量配置以及JDK版本切换所遇问题
- JavaScript制作简单网页时间变化
- oracle 游标的初级使用
- java.lang.IllegalStateException: Fatal Exception thrown on Scheduler.Worker thread.
- (java)RSA/ECB/PKCS1Padding算法加密和解密
- iOS 8 Expected a type:微信SDk报错解决