HDU 5253 连接的管道 (bfs + 优先队列)

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5253

广搜，和普通的优先队列广搜又不太一样，具体看代码吧。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
int N, M;
struct node {
	int x, y, cost;
	friend bool operator < (node a, node b) {
		return a.cost > b.cost;  //优先队列 
	}
};
int dir[4][2] = {0, 1, 1, 0, 0, -1, -1, 0};
int map[1010][1010];
int vis[1010][1010];
int main() {
	int T;
	scanf("%d", &T);
	int kase;
	for(kase = 1; kase <= T; kase++) {
		scanf("%d %d", &N, &M);
		int i, j;
		for(i = 1; i <= N; i++) {
			for(j = 1; j <= M; j++) {
				scanf("%d", &map[i][j]);
			}
		}
		memset(vis, 0, sizeof(vis));
		priority_queue<node> q;
		node now, next;
		now.x = 1, now.y = 1, now.cost = 0;
		q.push(now);
		int tot = N * M;  // 总点数，用于判退出 
		int minc = 0;
		printf("Case #%d:\n", kase);
		while(!q.empty()) {
			now = q.top();
			q.pop();
			if(vis[now.x][now.y] == 1) continue;  //有可能访问到重复的点 
			tot--;
			vis[now.x][now.y] = 1;
			minc += now.cost;
			if(tot == 0) {
				printf("%d\n", minc);
				break;
			}
			for(i = 0; i < 4; i++) {
				next.x = now.x + dir[i][0];
				next.y = now.y + dir[i][1];
				if(next.x < 1 || next.x > N || next.y < 1 || next.y > M || vis[next.x][next.y] == 1) {
					continue;
				}
				next.cost = abs(map[next.x][next.y] - map[now.x][now.y]);
				q.push(next);
			}
		}
	}
	return 0;
}