最短路
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 79390 Accepted Submission(s): 34417
Problem Description
在每年的校赛里,所有进入决赛的同学都会获得一件很漂亮的t-shirt。但是每当我们的工作人员把上百件的衣服从商店运回到赛场的时候,却是非常累的!所以现在他们想要寻找最短的从商店到赛场的路线,你可以帮助他们吗?
Input
输入包括多组数据。每组数据第一行是两个整数N、M(N<=100,M<=10000),N表示成都的大街上有几个路口,标号为1的路口是商店所在地,标号为N的路口是赛场所在地,M则表示在成都有几条路。N=M=0表示输入结束。接下来M行,每行包括3个整数A,B,C(1<=A,B<=N,1<=C<=1000),表示在路口A与路口B之间有一条路,我们的工作人员需要C分钟的时间走过这条路。
输入保证至少存在1条商店到赛场的路线。
输入保证至少存在1条商店到赛场的路线。
Output
对于每组输入,输出一行,表示工作人员从商店走到赛场的最短时间
Sample Input
2 1 1 2 3 3 3 1 2 5 2 3 5 3 1 2 0 0
Sample Output
3 2
# include<iostream>
# include <cstdio>
# include <cstdlib>
# include <cmath>
# include <algorithm>
# include <stack>
# include <string>
# include <cstring>
# include <vector>
# include <set>
# include <map>
using namespace std;
int const MAX = 505;
int const INF = 0x3f3f3f3f;
const int inf = 1 << 30;
bool vis[102] = { false };
int w[102][102] = {INF};
int d[102] = {INF};
int n, m;
int start = 1;
void dijkstra(int start)
{
for (int i = 1; i <= n; i++)
if (i == start)d[i] = 0;
for (int i = 1; i <= n; i++)
{
int x, mini = inf;
for (int j = 1; j <= n; j++)
{
if (!vis[j] && d[j] <= mini)
{
mini = d[j];
x = j;
}
}
vis[x] = true;
for (int j = 1; j <= n; j++)
{
d[j] = min(d[j],d[x]+w[x][j]);
}
}
}
int main()
{
while (cin >> n >> m&&n&&m)
{
start = 1;
memset(vis,false,sizeof(vis));
memset(w,INF,sizeof(w));
memset(d,INF,sizeof(d));
for (int i = 1; i <= m; i++)
{
int from, to, cost;
cin >> from >> to >> cost;
if (w[from][to]>cost)
{
w[from][to] = cost;
w[to][from] = cost;
}
}
//初始化以及输入阶段完成
dijkstra(start);
cout << d[n] << endl;
}
return 0;
}