给你n个点,m条无向边,每条边都有长度d和花费p,给你起点s终点t,要求输出起点到终点的最短距离及其花费,如果最短距离有多条路线,则输出花费最少的。
(1<n<=1000, 0<m<100000, s != t)
3 2 1 2 5 6 2 3 4 5 1 3 0 0
9 11
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
using namespace std;
#define INF 0x3f3f3f3f
struct Pair
{
int first,second,thred;
bool friend operator < (Pair a,Pair b)
{
if(a.second==b.second)
return a.thred>b.thred;
else
return a.second > b.second;
}
}pr,ne;
int n,m,s,t;
vector<int> edge[1005];
struct stu
{
int meter,cost;
}length[1005][1005],dis[1005];
void dijkstra()
{
for(int i=1;i<=n;i++)
{
dis[i].meter=INF;
dis[i].cost=INF;
}
bool vis[1005];
memset(vis,false,sizeof(vis));
dis[s].cost= 0;
dis[s].meter=0;
pr.first = s;
pr.second = 0;
pr.thred=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].meter;
ne.thred =pr.thred +length[pr.first][ne.first].cost ;
if (ne.second < dis[ne.first].meter)
{
dis[ne.first].meter = ne.second;
dis[ne.first].cost=ne.thred ;
Q.push(ne);
}
else if(ne.second==dis[ne.first].meter&&ne.thred<dis[ne.first].cost)
{
dis[ne.first].cost=ne.thred;
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,p;
scanf ("%d%d%d%d",&x,&y,&z,&p);
edge[x].push_back(y);
edge[y].push_back(x);
if (length[x][y].meter== -1)
{
length[x][y].meter= length[y][x].meter= z;
length[x][y].cost= length[y][x].cost= p;
}
else
{
if(z<length[x][y].meter)
{
length[x][y].meter= length[y][x].meter=z;
length[x][y].cost= length[y][x].cost=p;
}
else if(z==length[x][y].meter&&p<length[x][y].cost)
length[x][y].cost= length[y][x].cost=p;
}
}
scanf("%d %d",&s,&t);
dijkstra();
printf ("%d %d\n",dis[t].meter,dis[t].cost);;
}
return 0;
}