hdoj 1874 畅通工程续

基本最短路

优先队列+Dijkstra 

/*
PROG:
LANG: C++11 
*/
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <cstdlib>
#include <climits>
#include <ctype.h>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <deque>
#include <set>
#include <map>
#include <iostream>
#include <fstream>
#include <algorithm>
#include <time.h>

using namespace std;
#define mst(a,b) memset(a,b,sizeof(a))

typedef long long ll;
typedef pair<int, int> P;
const ll MOD = 1000000007;
const int INF = 0x7fffffff;

const int MAX_N = 201;
const int MAX_E = 1001;
struct edge{ int to, cost;};

vector<edge> G[MAX_N];
int d[MAX_N];
int N, E;
int s, destination;

int solve(int s, int dd){
    fill(d, d+MAX_N, INF);
    priority_queue<P, vector<P>, greater<P> > que;
    d[s] = 0;
    que.push(P(0, s));

    while(!que.empty()){
        P p = que.top();
        que.pop();
        int v = p.second;
        int x = p.first;
        if(d[v] < x)
            continue;
        for(int i = 0; i < G[v].size(); i++){
            edge e = G[v][i];
            if(d[e.to] > x + e.cost){
                d[e.to] = x + e.cost;
                que.push(P(d[e.to], e.to));
            }
        }
    }
    if(d[dd] == INF)
        printf("-1\n");
    else
        printf("%d\n",d[dd]);

}

int main()
{
    while(scanf("%d%d", &N, &E) != EOF){
        int a, b ,c;
        memset(d, 0, sizeof(d));
        for(int i = 0; i < MAX_N; i++)
            G[i].clear();
        for(int i= 0; i < E; i++){
            scanf("%d%d%d", &a, &b, &c);
            edge e1, e2;
            e1.to = b; e1.cost = c;
            e2.to = a; e2.cost = c;
            G[a].push_back(e1);
            G[b].push_back(e2);
        }
        scanf("%d%d", &s, &destination);
        solve(s, destination);
    }


    return 0;
}