Rescue(BFS + 优先队列)|HDU1242

最新推荐文章于 2020-04-21 10:32:44 发布

甘甘甘甘甘甘甘

最新推荐文章于 2020-04-21 10:32:44 发布

阅读量222

点赞数

分类专栏： BFS

本文链接：https://blog.csdn.net/a739260008/article/details/89518324

版权

BFS 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

Rescue

'x’的权值是2，其他的权值是1
用优先队列对插入的节点排序，时间消耗小的排在队首
每次都从时间消耗小的开始向四周发散（BFS）

#include <iostream>
#include<queue>
using namespace std;

struct Node {
	int x, y, step;
	Node(int a = 0, int b = 0, int c = 0) {
		x = a, y = b, step = c;
	}
	friend bool operator<(Node a, Node b) {// 时间消耗大的权值小
		return a.step > b.step;
	}
};

int n, m, sx, sy, gx, gy;
char maze[205][205];
int vis[205][205];
int dx[] = { 1,0,0,-1 };
int dy[] = { 0,1,-1,0 };

void bfs() {
	int ans = 0;
	int flag = 0;
	memset(vis, -1, sizeof(vis));
	priority_queue<Node> que;// 优先级高的在队首
	que.push(Node(sx, sy, 0));
	vis[sx][sy] = 1;
	while (!que.empty()) {
		Node u = que.top();
		que.pop();
		int x = u.x, y = u.y;
		if (x == gx && y == gy) {
			ans = u.step;
			flag = 1;
			break;
		}
		for (int i = 0; i < 4; i++) {
			int nx = x + dx[i], ny = y + dy[i];
			if ((0 <= nx && x < n) && (0 <= ny && ny < m) && (maze[nx][ny] != '#') && (vis[nx][ny] == -1)) {
				int step;
				if (maze[nx][ny] == 'x') step = u.step + 2;
				else step = u.step + 1;
				que.push(Node(nx, ny, step));
				vis[nx][ny] = 1;
			}
		}
	}
	if (flag) cout << ans << endl;
	else cout << "Poor ANGEL has to stay in the prison all his life." << endl;
}

int main()
{
	while (cin >> n >> m) {
		for (int i = 0; i < n; i++)
			for (int j = 0; j < m; j++) {
				cin >> maze[i][j];
				if (maze[i][j] == 'a') sx = i, sy = j;
				if (maze[i][j] == 'r') gx = i, gy = j;
			}
		bfs();
	}
	return 0;
}