hdu 1874 畅通工程续（最短路）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1874

思路：

注意重边的情况，养成好习惯~

#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <algorithm>
#include <iostream>
#include <iterator>
#include <sstream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#include <set>
//#define ONLINE_JUDGE
#define eps 1e-6
#define INF 0x7fffffff                                          //INT_MAX
#define inf 0x3f3f3f3f                                          //int??????????????????
#define FOR(i,a) for((i)=0;i<(a);(i)++)                          //[i,a);
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,c)scanf("%d%d%d",&a,&b,&c)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
#define MEM3(a) memset(a,0x3f,sizeof(a))
#define MEMS(a) memset(a,'\0',sizeof(a))
#define LL __int64
const double PI = acos(-1.0);
template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<class T> inline T Min(T a, T b) { return a < b ? a : b; }
template<class T> inline T Max(T a, T b) { return a > b ? a : b; }
using namespace std;
template<class T>
T Mint(T a, T b, T c) {
    if (a>b) {
        if (c>b)
            return b;
        return c;
    }
    if (c>a)
        return a;
    return c;
}
template<class T>
T Maxt(T a, T b, T c) {
    if (a>b) {
        if (c>a)
            return c;
        return a;
    }
    else if (c > b)
        return c;
    return b;
}

const int maxn=1005;
int S,T,n,m;
int map[maxn][maxn],d[maxn],s[maxn];
bool vis[maxn];

void Dijkstra(int pos){
    MEM1(vis);
    vis[pos]=1;
    for(int i=1;i<=n;i++){
        d[i]=map[pos][i];
    }
    for(int i=2;i<=n;i++){
        int x,m=INF;
        for(int j=1;j<=n;j++){
            if(!vis[j]&&d[j]<m){
                m=d[x=j];
            }
        }
        //if(m==inf)    return -1;
        vis[x]=1;
        for(int j=1;j<=n;j++){
            if(!vis[j])
                d[j]=min(d[j],d[x]+map[x][j]);
        }
    }
}


int main() {
#ifndef ONLINE_JUDGE
    freopen("test.in","r",stdin);
    freopen("test.out","w",stdout);
#endif
    while(~sfd(n,m)){
        for2(i,1,n){
            for2(j,1,n){
                map[i][j]=(i==j?0:inf);
            }
        }
        int a,b,c;
        for1(i,0,m){
            sft(a,b,c);
            a++,b++;
            if(c<map[a][b])
                map[a][b]=map[b][a]=c;
        }
        sfd(S,T);
        S++,T++;
        Dijkstra(S);
        if(d[T]>=inf) puts("-1");
        else pf(d[T]);
    }
    return 0;
}