POJ 2449 Remmarguts' Date（第k短路のA*算法）

Description

"Good man never makes girls wait or breaks an appointment!" said the mandarin duck father. Softly touching his little ducks' head, he told them a story.

"Prince Remmarguts lives in his kingdom UDF – United Delta of Freedom. One day their neighboring country sent them Princess Uyuw on a diplomatic mission."

"Erenow, the princess sent Remmarguts a letter, informing him that she would come to the hall and hold commercial talks with UDF if and only if the prince go and meet her via the K-th shortest path. (in fact, Uyuw does not want to come at all)"

Being interested in the trade development and such a lovely girl, Prince Remmarguts really became enamored. He needs you - the prime minister's help!

DETAILS: UDF's capital consists of N stations. The hall is numbered S, while the station numbered T denotes prince' current place. M muddy directed sideways connect some of the stations. Remmarguts' path to welcome the princess might include the same station twice or more than twice, even it is the station with number S or T. Different paths with same length will be considered disparate.

Input

The first line contains two integer numbers N and M (1 <= N <= 1000, 0 <= M <= 100000). Stations are numbered from 1 to N. Each of the following M lines contains three integer numbers A, B and T (1 <= A, B <= N, 1 <= T <= 100). It shows that there is a directed sideway from A-th station to B-th station with time T.

The last line consists of three integer numbers S, T and K (1 <= S, T <= N, 1 <= K <= 1000).

Output

A single line consisting of a single integer number: the length (time required) to welcome Princess Uyuw using the K-th shortest path. If K-th shortest path does not exist, you should output "-1" (without quotes) instead.

 

题目大意：求S到T的第K短路

思路：A*算法，f(n) = h(n) + g(n)，h(n)为从S走过重重关卡到点n的距离，g(n)为从n走到T的最短距离，在这里估价函数是完美的，所以是不会出错的。至于第k短路，只要找第k次走到终点即可。

PS：S == T的情况下，k要加一，因为不走好像是不算的……英文抓鸡完全看不到题目有这么说过>_<

 

 #include <cstdio>
 #include <cstring>
 #include <queue>
 #include <utility>
 using namespace std;

 const int INF = 0x3f3f3f3f;
 const int MAXN = ;
 const int MAXM = ;

 #define X first
 #define Y second

 typedef pair<int, int> PII;

 int head[MAXN], rhead[MAXN];
 int next[MAXM], rnext[MAXM], to[MAXM], rto[MAXM], cost[MAXM];
 int ecnt;

 void init() {
     ecnt = ;
     memset(head, , sizeof(head));
     memset(rhead, , sizeof(rhead));
 }

 void add_edge(int u, int v, int c) {
     cost[ecnt] = c;
     to[ecnt] = v; next[ecnt] = head[u]; head[u] = ecnt;
     rto[ecnt] = u; rnext[ecnt] = rhead[v]; rhead[v] = ecnt++;
 }

 int dis[MAXN];
 bool vis[MAXN];

 void dijkstra(int st, int n) {
     for(int i = ; i <= n; ++i) dis[i] = INF;
     memset(vis, , sizeof(vis));
     priority_queue<PII> Q;
     dis[st] = ; Q.push(make_pair(, st));
     while(!Q.empty()) {
         int u = Q.top().Y; Q.pop();
         if(vis[u]) continue;
         vis[u] = true;
         for(int p = rhead[u]; p; p = rnext[p]) {
             int v = rto[p];
             if(dis[v] > dis[u] + cost[p]) {
                 dis[v] = dis[u] + cost[p];
                 Q.push(make_pair(-dis[v], v));
             }
         }
     }
 }

 int a_star(int st, int ed, int n, int k) {
     priority_queue<PII> Q;
     Q.push(make_pair(-dis[st], st));
     while(!Q.empty()) {
         int u = Q.top().Y, c = -Q.top().X; Q.pop();
         if(u == ed && --k == ) return c;
         for(int p = head[u]; p; p = next[p])
             Q.push(make_pair(-(c - dis[u] + cost[p] + dis[to[p]]), to[p]));
     }
     return -;
 }

 int main() {
     int n, m, st, ed, k;
     while(scanf("%d%d", &n, &m) != EOF) {
         init();
         for(int i = ; i < m; ++i) {
             int u, v, c;
             scanf("%d%d%d", &u, &v, &c);
             add_edge(u, v, c);
         }
         scanf("%d%d%d", &st, &ed, &k);
         dijkstra(ed, n);
         if(dis[st] == INF) {
             printf("-1\n");
             continue;
         }
         if(st == ed) ++k;
         printf("%d\n", a_star(st, ed, n, k));
     }
 }