NYOJ 483 Nightmare(bfs)
来源:互联网 发布:国外域名国内备案 编辑:程序博客网 时间:2024/06/05 09:25
Nightmare
时间限制:1000 ms | 内存限制:65535 KB
难度:4
- 描述
- 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.- 输入
- 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. - 输出
- 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.
- 样例输入
23 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 3
- 样例输出
4-1
刚开始写的时候忘了炸弹时间的返回,TLE了几次,真是.....
ac代码:
#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>#include<queue>using namespace std;int map[10][10];int dir[4][2]={{1,0},{-1,0},{0,1},{0,-1}};int n,m,bz;struct s{int x;int y;int time;int hp;}a,b;int check(int xx,int yy){if(xx>=n||xx<0||yy>=m||yy<0||map[xx][yy]==0)return 0;return 1;}void bfs(int c,int d){queue<s>q;a.x=c;a.y=d;a.time=0;a.hp=6;q.push(a);while(!q.empty()){a=q.front();q.pop();if(a.hp==1)//剩最后一点了,最后一步{continue;}else if(map[a.x][a.y]==3){printf("%d\n",a.time);bz=1;return;}for(int i=0;i<4;i++){b.x=a.x+dir[i][0];b.y=a.y+dir[i][1];b.time=a.time+1;//时间先+1if(check(b.x,b.y)){ if(map[b.x][b.y]==1||map[b.x][b.y]==3) { b.hp=a.hp-1; q.push(b); } else if(map[b.x][b.y]==4)//延时 { b.hp=6; map[b.x][b.y]=1;//变为普通路 q.push(b); } }}}}int main(){int t,i,j;int bx,by;scanf("%d",&t);while(t--){bz=0;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) { bx=i;by=j; } }}bfs(bx,by);if(bz==0)printf("-1\n");}return 0;}
0 0
- NYOJ 483 Nightmare(bfs)
- nyoj 483 Nightmare 【bfs】
- NYOJ 483 Nightmare (无标记BFS)
- nyoj 483 Nightmare 【BFS + priority_queue】
- nyoj-483--Nightmare--BFS+允许回头
- HDU 10722 && nyoj 483 Nightmare【bfs】
- HDU 1072 NYOJ 483 Nightmare -- BFS+允许回头
- nyoj 483 nightmare
- NYOJ 483 Nightmare
- hdu1072 Nightmare(BFS)
- hdu1072 Nightmare(bfs)
- HDU1072 Nightmare(BFS)
- HDU1072(BFS)Nightmare
- hdu 1072 Nightmare (bfs)
- hdu 1072 Nightmare (BFS)
- hdu 1072 Nightmare bfs()
- hdu 1072Nightmare(bfs)
- HDU-#1072 Nightmare(BFS)
- 新建一个基于对话框的MFC程序, 按空格键发现程序退出。
- POJ 1275--Cashier Employment【差分约束,经典建边】
- Spring -- 4.0新特性 -- 泛型依赖注入
- CentOS7_x86_64部署WebLogic11g并设置开机自启
- IOS开发小tip
- NYOJ 483 Nightmare(bfs)
- nyoj 士兵杀敌 RMQ区间最值查询
- 1870 愚人节的礼物
- VS2008 C++ 错误 fatal error C1853: "Debug\sift.pch"
- Android ListView使用问题
- 关于onethinkphp 分类数据
- 关于4.4沉倾式状态栏
- HTML5 格式化方式以及应用
- 80端口被NT kernel & System占用