HDOJ 题目1072 Nightmare(dfs)
来源:互联网 发布:网络优化工程师 编辑:程序博客网 时间:2024/06/05 20:37
Nightmare
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7195 Accepted Submission(s): 3452
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
Ignatius.L
Recommend
We have carefully selected several similar problems for you: 1026 1240 1242 1175 1253
ac代码
#include<stdio.h>#include<string.h>int map[10][10],v[10][10],tv[10][10];int dx[4]={1,0,0,-1};int dy[4]={0,1,-1,0};int n,m,p,sum,w;int min=0xfffffff;void fun(int a[10][10],int b[10][10]){int i,j;for(i=0;i<n;i++){for(j=0;j<m;j++)b[i][j]=a[i][j];}}void dfs(int x,int y,int sum,int p){int drx,dry,i,j;if(map[x][y]==3&&p>=0){if(min>sum)min=sum;w=1;return;}for(i=0;i<4;i++){drx=x+dx[i];dry=y+dy[i];if(map[drx][dry]&&p>=1&&!v[drx][dry]){if(map[drx][dry]==4){int tp=p;fun(v,tv);map[drx][dry]=0;memset(v,0,sizeof(v));v[drx][dry]=1;p=5;dfs(drx,dry,sum+1,p);v[drx][dry]=0;map[drx][dry]=4;fun(tv,v);p=tp;}else{v[drx][dry]=1;dfs(drx,dry,sum+1,p-1);v[drx][dry]=0;}}}}int main(){int t,x;scanf("%d",&t);while(t--){//int n;int xi,yi,i,j;memset(map,0,sizeof(map));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){xi=i;yi=j;}}}sum=0;p=5;w=0;min=0xfffffff;memset(v,0,sizeof(v));v[xi][yi]=1;map[xi][yi]=0;dfs(xi,yi,sum,p);if(w)printf("%d\n",min);elseprintf("-1\n");}}
0 0
- HDOJ 题目1072 Nightmare(dfs)
- HDOJ 1072 Nightmare (DFS)
- HDOJ 1072 Nightmare(BFS)
- HDOJ 1072 Nightmare(BFS)
- HDOJ 1072 Nightmare (bfs)
- HDOJ 1072 Nightmare
- HDOJ 1072 Nightmare
- HDOJ 1072 Nightmare bfs
- hdoj 1072 Nightmare
- hdoj 1072 Nightmare 【bfs】
- hdoj 1072 Nightmare
- HDOJ 1072 Nightmare
- hdoj-【1072 Nightmare】
- hdoj-1072Nightmare
- hdu 1072 Nightmare(dfs)(转)
- HDU 1072 Nightmare(搜索-DFS)
- 搜索专题(DFS)HDU 1072-Nightmare
- HDU 1072Nightmare(dfs+剪枝)
- Android中app卡顿原因分析示例
- TCP连接的状态详解以及故障排查
- PostgreSQL热备功能实施手册
- 【转】VC编译器选项
- Android应用程序的Activity启动过程、Android应用程序启动过程源代码分析、Android应用程序内部启动Activity过程(startActivity)的源代码分析
- HDOJ 题目1072 Nightmare(dfs)
- Android 随机生成6位数字验证码
- Viewport及Window
- ASP.NET 安全认证(一)—— 如何运用 Form 表单认证
- 【Android】开发小经验1
- Jobdu 题目1017:还是畅通工程
- DevStore独家开放-智游推送开源安卓版SDK
- OCP 1Z0 053 266
- Functional Reactive Programming