POJ 2387 Til the Cows Come Home

    链接：http://vjudge.net/problem/viewProblem.action?id=18265

    题意：有 T 条边，N 个顶点，问从第 N 个顶点到达第 1 个顶点的最短距离是多少？

    解法：纯最短路模板题，dijkstra 直接求解。注意 T 和 N 的顺序。

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>

using namespace std;

#define INF 0x3f3f3f3f
#define MAXN 1003

struct node{
    int x,y;
    int d;
    node(int str1,int str2,int dis){
        x = str1;
        y = str2;
        d = dis;
    }
};

int n,m,dis[MAXN];
vector<node> way[MAXN];
typedef pair<int,int>pii;

void init()
{
    memset(way,0,sizeof(way));
	for(int i = 0;i <= n;++i)
		dis[i] = INF;

	for(int i = 0;i < m;++i)
	{
		int t1,t2,d;
		cin>>t1>>t2>>d;
		way[t1].push_back(node(t1,t2,d));
		way[t2].push_back(node(t2,t1,d));
	}
}

int dijkstra()
{
    priority_queue<pii> q;
    dis[n] = 0;
    pii cur;
    q.push(make_pair(0,n));
    while(!q.empty())
	{
        cur = q.top();
        q.pop();
        int x = cur.second;
        if(cur.first != dis[x]) continue;
        for(int i=0;i<way[x].size();++i)
		{
            int y = way[x][i].y;
            int w = way[x][i].d;
            if(dis[x] + w < dis[y])
			{
                dis[y] = dis[x] + w;
                q.push(make_pair(dis[y],y));
            }
        }
    }
    if(dis[1] == INF)
        return -1;
    else return dis[1];
}

int main()
{
    while(cin>>m>>n)
	{
        init();
		int ans = dijkstra();
		cout<<ans<<endl;
    }
    return 0;
}