在每年的校赛里,所有进入决赛的同学都会获得一件很漂亮的t-shirt。但是每当我们的工作人员把上百件的衣服从商店运回到赛场的时候,却是非常累的!所以现在他们想要寻找最短的从商店到赛场的路线,你可以帮助他们吗?
输入保证至少存在1条商店到赛场的路线。
2 1 1 2 3 3 3 1 2 5 2 3 5 3 1 2 0 0
3 2
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
using namespace std;
#define INF 0x3f3f3f3f
struct Pair
{
int first,second;
bool friend operator < (Pair a,Pair b)
{
return a.second > b.second;
}
}pr,ne;
int n,m;
vector<int> edge[105];
int length[105][105];
int dis[105];
void dijkstra()
{
memset(dis,INF,sizeof(dis));
bool vis[105];
memset(vis,false,sizeof(vis));
dis[1] = 0;
pr.first = 1;
pr.second = 0;
priority_queue<Pair> Q;
Q.push(pr);
while (!Q.empty())
{
pr = Q.top();
Q.pop();
if (vis[pr.first])
continue;
vis[pr.first] = true;
for (int i = 0 ; i < edge[pr.first].size() ; i++)
{
ne.first = edge[pr.first][i];
ne.second = pr.second + length[pr.first][ne.first];
if (ne.second < dis[ne.first])
{
dis[ne.first] = ne.second;
Q.push(ne);
}
}
}
}
int main()
{
while(~scanf ("%d%d",&n,&m))
{
if(n==0&&m==0)
break;
memset(edge,0,sizeof(edge));
memset(length,-1,sizeof(length));
for (int i = 1 ; i <= m ; i++)
{
int x,y,z;
scanf ("%d%d%d",&x,&y,&z);
edge[x].push_back(y);
edge[y].push_back(x);
if (length[x][y] == -1)
length[x][y] = length[y][x] = z;
else
length[x][y] = length[y][x] = min(z,length[x][y]);
}
dijkstra();
printf ("%d\n",dis[n]);
}
return 0;
}