最短路径问题
Problem Description
给你n个点,m条无向边,每条边都有长度d和花费p,给你起点s终点t,要求输出起点到终点的最短距离及其花费,如果最短距离有多条路线,则输出花费最少的。
Input
输入n,m,点的编号是1~n,然后是m行,每行4个数 a,b,d,p,表示a和b之间有一条边,且其长度为d,花费为p。最后一行是两个数 s,t;起点s,终点。n和m为0时输入结束。
(1<n<=1000, 0<m<100000, s != t)
(1<n<=1000, 0<m<100000, s != t)
Output
输出 一行有两个数, 最短距离及其花费。
Sample Input
3 2 1 2 5 6 2 3 4 5 1 3 0 0
Sample Output
9 11
代码如下:
#include <bits/stdc++.h>
#define INF INT_MAX / 10
using namespace std;
const int maxn = 1005;
const int maxm = 100005;
int dis[maxn],cost[maxn];
int n,m;
struct edge
{
int to;
int dis;
int cost;
edge(int to,int dis,int cost){
this -> to = to;
this -> dis = dis;
this -> cost = cost;
}
edge(){}
};
struct node
{
int dis;
int cost;
int v;
node(int dis,int cost,int v){
this -> dis = dis;
this -> cost = cost;
this -> v = v;
}
node(){}
bool operator < (const node& a)const{
if(dis == a.dis) return cost > a.cost;
return dis > a.dis;
}
};
vector<edge> G[maxn];
priority_queue<node> que;
void init()
{
for(int i = 1;i <= n;i++)
G[i].clear();
}
void add_edge(int from,int to,int dis,int cost)
{
G[from].push_back(edge(to,dis,cost));
G[to].push_back(edge(from,dis,cost));
}
void dijksta(int s)
{
while(que.size()) que.pop();
for(int i = 1;i <= n;i++)
dis[i] = INF,cost[i] = INF;
dis[s] = cost[s] = 0;
que.push(node(0,0,s));
while(que.size()){
node nd = que.top();
que.pop();
int u = nd.v;
if(dis[u] < nd.dis) continue;
for(int i = 0;i < (int)G[u].size();i++){
edge e = G[u][i];
if(dis[e.to] > dis[u] + e.dis){
dis[e.to] = dis[u] + e.dis;
cost[e.to] = cost[u] + e.cost;
que.push(node(dis[e.to],cost[e.to],e.to));
}else if(dis[e.to] == dis[u] + e.dis){
if(cost[e.to] > cost[u] + e.cost){
cost[e.to] = cost[u] + e.cost;
que.push(node(dis[e.to],cost[e.to],e.to));
}
}
}
}
return ;
}
int main()
{
int a,b,c,d;
while(scanf("%d %d",&n,&m) != EOF && (n || m)){
init();
for(int i = 0;i < m;i++){
scanf("%d %d %d %d",&a,&b,&c,&d);
add_edge(a,b,c,d);
}
scanf("%d %d",&a,&b);
dijksta(a);
printf("%d %d\n",dis[b],cost[b]);
}
return 0;
}