POJ 2449 Remmarguts' Date（k限最短路）

题目链接：http://poj.org/problem?id=2449

题意：

给出起点和终点， 找从起点到终点的第K短路， 如果起点与终点相同， 也要出去走一圈才能算最短路。

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
const int inf = 0x3f3f3f3f;
const int maxn = 1e3 + 10;
int dis[maxn];
int vis[maxn];
int n, m, st, en, k;
struct Edge
{
    int to, dist;
    Edge(int t, int d) : to(t), dist(d) {}
};
vector<Edge> G[maxn];
vector<Edge> Gg[maxn];
struct Node
{
    int v, d;
    Node(int v, int d) : v(v), d(d) {}
    bool operator < (const Node& rhs) const
    {
        return d > rhs.d;
    }
};
struct Info
{
    int v, d;
    Info(int v, int d) : v(v), d(d) {}
    bool operator < (const Info& rhs) const
    {
        return d+dis[v] > rhs.d+dis[rhs.v];
    }
};
void Dijkstra(int src)
{
    priority_queue<Node> Q;
    memset(vis, 0, sizeof(vis));
    memset(dis, 0x3f, sizeof(dis));
    dis[src] = 0;
    Q.push(Node(src, dis[src]));
    while(!Q.empty())
    {
        Node x = Q.top();
        Q.pop();
        int u = x.v;
        if(vis[u] == 1)
            continue;
        vis[u] = 1;
        for(int i = 0; i < Gg[u].size(); i++)
        {
            Edge e = Gg[u][i];
            if(dis[e.to] > dis[u]+e.dist)
            {
                dis[e.to] = dis[u] + e.dist;
                Q.push(Node(e.to, dis[e.to]));
            }
        }
    }
}
int a_star(int src)
{
    priority_queue<Info> Q;
    Q.push(Info(src, 0));
    k--;
    while(!Q.empty())
    {
        Info x = Q.top();
        Q.pop();
        int u = x.v;
        if(u == en)
        {
            if(k)
            {
                k--;
            }
            else
            {
                return x.d;
            }
        }
        for(int i = 0; i < G[u].size(); i++)
        {
            Edge e = G[u][i];
            Q.push(Info(e.to, x.d+e.dist));
        }
    }
    return -1;
}
int main()
{
    int a, b, c;
    while(~scanf("%d%d", &n, &m))
    {
        for(int i = 0; i <= n; i++)
        {
            G[i].clear();
            Gg[i].clear();
        }
        for(int i = 0; i < m; i++)
        {
            scanf("%d%d%d", &a, &b, &c);
            G[a].push_back(Edge(b, c));
            Gg[b].push_back(Edge(a, c));
        }
        scanf("%d%d%d", &st, &en, &k);
        Dijkstra(en);
        if(dis[st] == inf)
        {
            puts("-1");
            continue;
        }
        if(st == en)//要求起点和终点相同，也要出去走一圈才算最短路
        {
            k++;
        }
        printf("%d\n", a_star(st));
    }
    return 0;
}