POJ3255(次短路)

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <set>
#include <vector>
#include <climits>
#include <queue>
using namespace std;
typedef long long LL;
const int maxn = 100001;

typedef pair<int , int> P;

struct edge
{
    int to , cost;
};

int INF = 99999999;
int n , r;
vector<edge> g[maxn];
int dist[maxn];
int dist2[maxn];

void solve()
{
    priority_queue< P , vector<P> , greater<P> > que;
    fill(dist , dist + n , INF);
    fill(dist2 , dist2 + n , INF);
    dist[0] = 0;
    que.push(P(0 , 0));
    while(!que.empty())
    {
        P p = que.top();
        que.pop();
        int v = p.second , d = p.first;
        if(dist2[v] < d)
        {
            continue;
        }
        for(int i = 0 ; i < g[v].size() ; i ++)
        {
            edge &e = g[v][i];
            int d2 = d + e.cost;
            if(dist[e.to] > d2)
            {
                swap(dist[e.to] , d2);
                que.push(P(dist[e.to] , e.to));
            }
            if(dist2[e.to] > d2 && dist[e.to] < d2)
            {
                dist2[e.to] = d2;
                que.push(P(dist2[e.to] , e.to));
            }
        }
    }
    cout << dist2[n-1] << endl;
}

int main()
{

    #ifdef DoubleQ
    freopen("in.txt" , "r" , stdin);
    #endif
    while(cin >> n >> r)
    {
        int a , b , d;
        for(int i = 0 ; i < r ; i ++)
        {
            cin >> a >> b >> d;
            a --;
            b --;
            struct edge temp;
            temp.to = b;
            temp.cost = d;
            g[a].push_back(temp);

            struct edge temp2;
            temp2.to = a;
            temp2.cost = d;
            g[b].push_back(temp2);
        }

        solve();
    }
    return 0;
}