POJ 2499 第k小最短路

/*
简单A*一直搜就可以
坑点是s=t时，假设k=1，不能直接返回0，因为要求必须走过路程
*/

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <string>
#include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
#include <utility>
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define LL long long
typedef pair<int,int> pii;
typedef pair<int,int> pii2;
const int MAXN = 1000 + 5;
int n, m, vis[MAXN];
vector<pii>e[MAXN], reve[MAXN];
int d[MAXN];
struct Node
{
    int fi;
    int se;
    Node(){}
    Node(int _fi, int _se){fi = _fi; se = _se;}
    bool operator < (const Node &rbs) const{return rbs.fi < fi;}
};
priority_queue<Node> que;
void Bellman(int u)
{
    queue<int>Q;
    for(int i = 1 ; i <= n ; i++) d[i] = -1, vis[i] = 0;
    vis[u] = 1, d[u] = 0; Q.push(u);
    while(!Q.empty()) {
        int v = Q.front(); Q.pop();
        vis[v] = 0;
        for(int i = 0 ; i < (int)reve[v].size() ; i++ ) {
            pii p = reve[v][i];
            if(d[p.fi] == -1 || d[p.fi] > d[v] + p.se) {
                d[p.fi] = d[v] + p.se;
                if(vis[p.fi] == 0) {
                    vis[p.fi] = 1;
                    Q.push(p.fi);
                }
            }
        }
    }
}
int main()
{
//    que.push(Node(1, 2));
//    que.push(Node(2, 3));
//    while(!que.empty()) {
//        Node node = que.top(); que.pop();
//        printf("node = %d %d\n", node.fi, node.se);
//    }
    while(scanf("%d%d", &n, &m) != EOF) {
        for(int i = 1 ; i <= n ; i++) e[i].clear(), reve[i].clear();
        for(int i = 1 ; i <= m ; i++) {
            int u, v, w;    scanf("%d%d%d", &u, &v, &w);
            e[u].pb(mp(v, w));
            reve[v].pb(mp(u, w));
        }
        int s, t, k;    scanf("%d%d%d", &s, &t, &k);
        if(s == t) k++;
        Bellman(t);
        if(d[s] == -1) {
            puts("-1");
            continue;
        }
        int cnt = 0;
        int res = -1;
        while(!que.empty()) que.pop();
        que.push(Node(d[s], s));
        while(!que.empty() && cnt < k) {
            Node p = que.top(); que.pop();
            if(p.se == t) cnt++;
            if(cnt == k) {
                res = p.fi;
                break;
            }
            for(int i = 0 ; i < (int)e[p.se].size() ; i++) {
                pii p2 = e[p.se][i];
                if(d[p2.fi] == -1) continue;
                que.push(Node(p.fi - d[p.se] + p2.se + d[p2.fi], p2.fi));
            }
//            printf("p = %d %d, cnt = %d, que.size() = %d\n", p.fi, p.se, cnt, (int)que.size());
        }
//        while(!que.empty() && cnt < k - 1) {
//            que.pop();
//        }
//        if(!que.empty() && cnt == k - 1) res = que.top().fi;
//        printf("%d\n", res);
        cout << res << endl;
    }
    return 0;
}