POJ2449 Remmarguts' Date A*搜索K短路

Remmarguts’ Date

Time Limit: 4000MS Memory Limit: 65536K
Total Submissions: 29778 Accepted: 8083
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.
Sample Input

2 2
1 2 5
2 1 4
1 2 2
Sample Output

14
Source

POJ Monthly,Zeyuan Zhu

#include<iostream>#include<cstring>#include<cstdio>#include<queue>using namespace std;#define maxn 1005#define maxm 100050#define INF 10000000struct Edge{ int v,w,next; }e[maxm],re[maxm];int head[maxn],rehead[maxn],dis[maxn],tot,retot;int S,T,K,n,m;struct Data{    int now,f,g;//now ->当前点    //评估函数h不写 反向SPFA可以得到确切值    bool operator < (const Data a) const {        if(f==a.f) return a.g < g;        return a.f < f;    }};queue<int> q;bool exist[maxn];void Add_Edge(int u,int v,int w){    e[++tot].v=v;e[tot].w=w;    e[tot].next=head[u];head[u]=tot;    re[++retot].v=u;re[retot].w=w;    re[retot].next=rehead[v];rehead[v]=retot;}void SPFA(int s){    memset(exist,0,sizeof exist );    for(int i=1;i<=n;i++) dis[i]=INF;    q.push(s);dis[s]=0;exist[s]=true;    while(!q.empty()){        int u=q.front();q.pop();exist[u]=false;        for(int i=rehead[u];i;i=re[i].next){            int v=re[i].v,w=re[i].w;            if(dis[v]>dis[u]+w){                dis[v]=dis[u]+w;                if(!exist[v]) q.push(v),exist[v]=true;            }        }    }}priority_queue<Data> que;int AStar(int src,int des){    int cnt=0;    if(src==des) K++;    if(dis[src]==INF) return -1;//不可到达    Data t,tt;    t.now=src;t.g=0;t.f=t.g+dis[src];    que.push(t);    while(!que.empty()){        tt=que.top();que.pop();        if(tt.now==des){            cnt++;            if(cnt==K) return tt.g;        }        for(int i=head[tt.now];i;i=e[i].next){            t.now=e[i].v;            t.g=tt.g+e[i].w;            t.f=t.g+dis[t.now];            que.push(t);        }    }    return -1;}int main(){    scanf("%d%d",&n,&m);    for(int u,v,w,i=1;i<=m;i++){        scanf("%d%d%d",&u,&v,&w);        Add_Edge(u,v,w);    }    scanf("%d%d%d",&S,&T,&K);    SPFA(T);    printf("%d\n",AStar(S,T));    return 0;}