hdu-1072
2016-07-19 15:25
183 查看
http://acm.hdu.edu.cn/showproblem.php?pid=1072
Nightmare
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9853 Accepted Submission(s): 4792
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
1、不需要全部标记,因为走过的地方可能还会走
2、注意炸弹时间的改变,到“4”的位置时间记为0
3、注意入队的时间大于6的就没有意义了
#include<iostream> #include<cstring> #include<cstdio> #include<queue> using namespace std; int g[110][110], n, m; int d[4][2]={1,0,0,1,-1,0,0,-1}; struct node{ int x, y, z, time; bool is; bool operator < (const node &a) const{ return z>a.z; } }; bool ok(node a){ return a.x>=0&&a.x<n&&a.y>=0&&a.y<m; } priority_queue<node> q; int main(){ int T, i, j; node s, e; scanf("%d",&T); while(T--){ while(!q.empty()) q.pop(); scanf("%d%d",&n,&m); for(i=0; i<n; i++){ for(j=0; j<m; j++){ scanf("%d",&g[i][j]); if(g[i][j]==2){ s.x = i; s.y = j; s.z = 0; s.time = 0; s.is = false; } else if(g[i][j]==3){ e.x = i; e.y = j; } } } q.push(s); bool flag = false; node t, b; while(!q.empty()){ t=q.top(); q.pop(); //cout<<" "<<t.x<<" "<<t.y<<endl; if(t.x==e.x&&t.y==e.y&&t.time<6){ flag = true; printf("%d\n",t.z); break; } for(i=0; i<4; i++){ b.x=t.x+d[i][0]; b.y=t.y+d[i][1]; if(ok(b)&&g[b.x][b.y]==4){ b.z = t.z+1; if(t.time+1==6){ continue; } else{ b.time = 0; t.is = true; q.push(b); g[t.x][t.y] = 1; g[b.x][b.y] = 0; } } else if(ok(b)&&(g[b.x][b.y]==1||g[b.x][b.y]==3)){ if(t.is){ b.z = t.z+1; b.time=t.time+1; if(b.time<6){ q.push(b); } } //printf("%d %d\n",b.x,b.y); else{ b.z = t.z+1; b.time=t.time+1; if(b.time<6){ q.push(b); g[b.x][b.y]=0; } } } } } if(!flag) puts("-1"); } return 0; }
相关文章推荐
- 在线表格,推荐使用超级表格——超好用的电子表格
- zxing
- [备注] Linux系统结构 详解
- 找工作的方法
- Integer ,==,int 的使用
- 我的收藏
- Android开发技术周报 Issue#1
- Android开发技术周报 Issue#2
- 如何使用git在github上开发的时候和别人在别人仓库上进行协作编程,最后再统一提交
- Activity保存状态
- MySQL 的各存储引擎特点-MySQ 存储引擎选择
- bitset优化背包...
- SSH Secure Shell Client乱码问题
- malloc calloc realloc 作用、用法、区别、实现原理
- 贝叶斯分类数据集的网站
- Spring AOP 详解(转载)
- 事务了解
- Android GRADLE构建最佳实践
- 完全背包-背包问题程序源代码(pascal)
- Extjs使用Kindeditor编辑套打样式