这道题目用邻接表或前向星是不需要考虑重边的,只有用邻接矩阵才考虑重边,还有就是注意优先级的的设置(数据给的太少,导致优先级搞错了也能输出正确结果),至于对花费的处理和最短距离的处理相似
给你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<stdio.h>
#include<string.h>
#include<queue>
#define inf 0x3f3f3f3f
#define maxe 100005
#define maxv 1005
using namespace std;
struct list
{
int des;
int weight;
int distance;
list() { }
list(int c,int d,int e)
{
des=c;
weight=d;
distance=e;
}
friend bool operator <(struct list a,struct list b)
{
if(a.weight==b.weight)
return a.distance>b.distance;
else
return a.weight>b.weight;
}
};
struct Edge
{
int v;
int p;
int w;
int next;
}edge[2*maxe];
int t,cnt,head[maxe],dis[maxv],price[maxv];
bool vis[maxv];
void add_Edge(int u,int v,int w,int p)
{
edge[cnt].v=v;
edge[cnt].w=w;
edge[cnt].p=p;
edge[cnt].next=head[u];
head[u]=cnt++;
}
void dijkstra(int s)
{
memset(dis,inf,sizeof(dis));
memset(price,inf,sizeof(price));
memset(vis,false,sizeof(vis));
priority_queue<struct list> q;
dis[s]=0;
price[s]=0;
q.push(list(s,dis[s],price[s]));
while(!q.empty())
{
struct list Q=q.top();
q.pop();
if(Q.des==t)
break;
if(vis[Q.des])
continue;
vis[Q.des]=true;
for(int i=head[Q.des];i!=-1;i=edge[i].next)
{
int to=edge[i].v;
if(dis[to]>dis[Q.des]+edge[i].w)
{
price[to]=price[Q.des]+edge[i].p;
dis[to]=dis[Q.des]+edge[i].w;
q.push(list(to,dis[to],price[to]));
}
else if(dis[to]==dis[Q.des]+edge[i].w)
{
if(price[to]>price[Q.des]+edge[i].p)
{
price[to]=price[Q.des]+edge[i].p;
q.push(list(to,dis[to],price[to]));
}
}
}
}
}
int main()
{
int n,m;
while(scanf("%d%d",&n,&m),n||m)
{
cnt=0;
memset(edge,0,sizeof(edge));
memset(head,-1,sizeof(head));
while(m--)
{
int a,b,c,d;
scanf("%d%d%d%d",&a,&b,&c,&d);
add_Edge(a,b,c,d);
add_Edge(b,a,c,d);
}
int s;
scanf("%d%d",&s,&t);
dijkstra(s);
printf("%d %d\n",dis[t],price[t]);
}
return 0;
}
自己写的测试数据:
3 3
1 2 5 6
2 3 4 5
2 3 3 10
1 3
8 16
3 3
1 2 5 6
2 3 4 5
2 3 4 10
1 3
9 11
3 3
1 2 5 6
2 3 4 5
2 3 5 1
1 3
9 11