题意:输入包括多组数据。每组数据第一行是两个整数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分钟的时间走过这条路。<br>输入保证至少存在1条商店到赛场的路线。
思路:找最短路程
AC代码:
#include<iostream>
#include<string.h>
#include<stdio.h>
#include<vector>
#include<queue>
using namespace std;
struct road
{
int end;
int cost;
friend bool operator < (const road &a,const road &b)
{
return a.cost>b.cost;
}
};
priority_queue<road> que;
vector<road> v[100005];
bool vis[100005];
int main()
{
int n,m,i,j;
int a,b,c;
road p;
while(scanf("%d%d",&n,&m))
{
if(n==0&&m==0)
break;
memset(vis,0,sizeof(vis));
for(i=0;i<10005;i++)
v[i].clear();
for(i=0;i<m;i++)
{
scanf("%d%d%d",&a,&b,&c);
p.end=b;
p.cost=c;
v[a].push_back(p);
p.end=a;
p.cost=c;
v[b].push_back(p);
}
p.end=1;
p.cost=0;
que.push(p);
road now,next;
while(!que.empty())
{
now=que.top();
que.pop();
if(vis[now.end])
continue;
#include<string.h>
#include<stdio.h>
#include<vector>
#include<queue>
using namespace std;
struct road
{
int end;
int cost;
friend bool operator < (const road &a,const road &b)
{
return a.cost>b.cost;
}
};
priority_queue<road> que;
vector<road> v[100005];
bool vis[100005];
int main()
{
int n,m,i,j;
int a,b,c;
road p;
while(scanf("%d%d",&n,&m))
{
if(n==0&&m==0)
break;
memset(vis,0,sizeof(vis));
for(i=0;i<10005;i++)
v[i].clear();
for(i=0;i<m;i++)
{
scanf("%d%d%d",&a,&b,&c);
p.end=b;
p.cost=c;
v[a].push_back(p);
p.end=a;
p.cost=c;
v[b].push_back(p);
}
p.end=1;
p.cost=0;
que.push(p);
road now,next;
while(!que.empty())
{
now=que.top();
que.pop();
if(vis[now.end])
continue;
vis[now.end]=true;
if(now.end==n)
break;
int d=v[now.end].size();
for(i=0;i<d;i++)
{
next.end=v[now.end][i].end;
if(vis[next.end])
continue;
next.cost=v[now.end][i].cost+now.cost;
que.push(next);
}
}
cout<<now.cost<<endl;
while(!que.empty())
{
que.pop();
}
if(now.end==n)
break;
int d=v[now.end].size();
for(i=0;i<d;i++)
{
next.end=v[now.end][i].end;
if(vis[next.end])
continue;
next.cost=v[now.end][i].cost+now.cost;
que.push(next);
}
}
cout<<now.cost<<endl;
while(!que.empty())
{
que.pop();
}
}
return 0;
}
return 0;
}