NYOJ 483 Nightmare (无标记BFS)
来源:互联网 发布:知乎反对能看到吗 编辑:程序博客网 时间:2024/05/22 09:41
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
分析:每个点可以走多次,故不需要标记数组
#include <iostream>#include <queue>#include <cstring>#include <algorithm>using namespace std;const int maxn = 10;struct node{ int x, y, step, time;};int t, n, m;int map[maxn][maxn];int dir[4][2] = {{1,0}, {-1,0}, {0,1}, {0, -1}};int bfs(int x, int y){ node cur, next; cur.x = x, cur.y = y; cur.step = 0, cur.time = 6; queue<node> q; q.push(cur); while (!q.empty()){ cur = q.front(); q.pop(); if (map[cur.x][cur.y] == 3) return cur.step; if (cur.time == 1) continue; for (int i = 0; i < 4; i++){ next.x = cur.x + dir[i][0]; next.y = cur.y + dir[i][1]; next.step = cur.step + 1; next.time = cur.time - 1; if (next.x >= 0 && next.x < n && next.y >= 0 && next.y < m && map[next.x][next.y]){ if (map[next.x][next.y] == 4){ next.time = 6; map[next.x][next.y] = 1; } q.push(next); } } } return -1;}int main(){ int sx, sy; cin >> t; while (t--){ cin >> n >> m; for (int i = 0; i < n; i++){ for (int j = 0; j < m; j++){ cin >> map[i][j]; if (map[i][j] == 2) sx = i, sy = j; } } cout << bfs(sx, sy) << endl; } return 0;}
0 0
- NYOJ 483 Nightmare (无标记BFS)
- NYOJ 483 Nightmare 【广搜】+【无标记】
- 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 Nightmare(BFS||DFS)(不标记的剪枝)
- 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)(注:不标记每个节点四方向累计4次剪枝)
- hdu 1072 Nightmare (bfs)
- hdu 1072 Nightmare (BFS)
- Centos接触 (三)在CentOS上搭建PHP服务器环境
- 基于HTML5 Canvase的在线画图及图片处理工具
- NYOJ 325 zb的生日 (DFS)
- 基于netty的客户端和服务器收发消息的小程序
- NYOJ 353 3D dungeon (BFS)
- NYOJ 483 Nightmare (无标记BFS)
- 切勿再用“过了再说”安慰自己
- 20160611
- 第25课:spark streaming的streamingContext启动及Jobschedule启动源码图解
- 数据库中的QueryRunner的大致实现
- ubuntu12.04打字软件
- webService学习9:jquery ajax调用webservice
- mysql行变列
- Java (数组的遍历,for循环的使用)