POJ2449 Remmarguts' Date A*

题目链接

http://poj.org/problem?id=2449

分析

对于优先队列BFS来说，当某个点第 $k$ 次从队列中取出时，此时求得的路径即为第 $k$ 短路。

求两点间第 $k$ 短路，显然最多只需要求出各点的第 $k$ 短路，复杂度上界为 $O(k\ast (n+m)log(n+m))$。

以某点到终点的最短路作为未来路径长度的估价函数跑A*算法，可保证能求出正确解，且效率很高。

AC代码

#include <cstdio>
#include <cstring>
#include <queue>

using namespace std;

inline int read() {
	int num = 0;
	char c = getchar();
	while (c < '0' || c > '9') c = getchar();
	while (c >= '0' && c <= '9')
		num = num * 10 + c - '0', c = getchar();
	return num;
}

const int maxn = 1e3 + 5, maxm = 1e5 + 5;

int head0[maxn], head[maxn], eid0, eid;

struct Edge {
	int v, w, next;
} edge0[maxm], edge[maxm];

inline void insert(int u, int v, int w) {
	edge0[++eid0].v = u, edge0[eid0].w = w;
	edge0[eid0].next = head0[v];
	head0[v] = eid0;
	edge[++eid].v = v, edge[eid].w = w;
	edge[eid].next = head[u];
	head[u] = eid;
}

struct Node {
	int id, d, f;

	Node(int i, int d, int f) : id(i), d(d), f(f) {}

	bool operator < (const Node& rhs) const {
		return d + f > rhs.d + rhs.f;
	}
};

int dist[maxn], cnt[maxn];
priority_queue<Node> q;

inline void dijkstra(int s) {
	memset(dist, 0x3f, sizeof(dist));
	dist[s] = 0;
	q.push(Node(s, 0, 0));
	while (!q.empty()) {
		Node x = q.top();
		q.pop();
		int u = x.id;
		if (x.d > dist[u]) continue;
		for (int p = head0[u]; p; p = edge0[p].next) {
			int v = edge0[p].v, w = edge0[p].w;
			if (dist[v] > dist[u] + w) {
				dist[v] = dist[u] + w;
				q.push(Node(v, dist[v], 0));
			}
		}
	}
}

inline int A_star(int s, int t, int k) {
	q.push(Node(s, 0, dist[s]));
	while (!q.empty()) {
		Node x = q.top();
		q.pop();
		int u = x.id, d = x.d;
		++cnt[u];
		if (cnt[t] == k) return d;
		for (int p = head[u]; p; p = edge[p].next) {
			int v = edge[p].v, w = edge[p].w;
			if (cnt[v] < k)
				q.push(Node(v, d + w, d + w + dist[v]));
		}
	}
	return -1;
}

int main() {
	read();
	int m = read();
	for (int i = 1; i <= m; ++i) {
		int u = read(), v = read(), w = read();
		insert(u, v, w);
	}
	int s = read(), t = read(), k = read();
	if (s == t) ++k; // 注意起点和终点相同的情况
	dijkstra(t);
	printf("%d", A_star(s, t, k));
	return 0;
}