Invitation Cards(HDU 1535)---多源单汇最短路问题

题目链接

题目描述

In the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want to propagate theater and, most of all, Antique Comedies. They have printed invitation cards with all the necessary information and with the programme. A lot of students were hired to distribute these invitations among the people. Each student volunteer has assigned exactly one bus stop and he or she stays there the whole day and gives invitation to people travelling by bus. A special course was taken where students learned how to influence people and what is the difference between influencing and robbery.
The transport system is very special: all lines are unidirectional and connect exactly two stops. Buses leave the originating stop with passangers each half an hour. After reaching the destination stop they return empty to the originating stop, where they wait until the next full half an hour, e.g. X:00 or X:30, where ‘X’ denotes the hour. The fee for transport between two stops is given by special tables and is payable on the spot. The lines are planned in such a way, that each round trip (i.e. a journey starting and finishing at the same stop) passes through a Central Checkpoint Stop (CCS) where each passenger has to pass a thorough check including body scan.
All the ACM student members leave the CCS each morning. Each volunteer is to move to one predetermined stop to invite passengers. There are as many volunteers as stops. At the end of the day, all students travel back to CCS. You are to write a computer program that helps ACM to minimize the amount of money to pay every day for the transport of their employees.

输入格式

The input consists of N cases. The first line of the input contains only positive integer N. Then follow the cases. Each case begins with a line containing exactly two integers P and Q, 1 <= P,Q <= 1000000. P is the number of stops including CCS and Q the number of bus lines. Then there are Q lines, each describing one bus line. Each of the lines contains exactly three numbers - the originating stop, the destination stop and the price. The CCS is designated by number 1. Prices are positive integers the sum of which is smaller than 1000000000. You can also assume it is always possible to get from any stop to any other stop.

输出格式

For each case, print one line containing the minimum amount of money to be paid each day by ACM for the travel costs of its volunteers.

输入样例

2
2 2
1 2 13
2 1 33
4 6
1 2 10
2 1 60
1 3 20
3 4 10
2 4 5
4 1 50

输出样例

46
210

分析

题目大意是有n个公交站和m条单向路线，有n个学生从1号车站出发到其余各个车站，再从各个车站返回1号车站，每个车站最多只去一人，现在求这个过程的最小花费。
显然从1号车站到其余各个车站的最小花费很简单，直接套模板就好了；而对于从其他各个车站返回1号车站这种多起点一汇点的问题，通常是建反图将其转化成单源最短路径问题来求解的。
以下是分别用dijkstra、SPFA和SPFA(SLF优化)算法写成的源码。

源程序

Dijkstra算法

#include <bits/stdc++.h>
#define MAXN 1000005
using namespace std;
struct Edge{	//链式前向星 
	int v,w,next;
	Edge(){};
	Edge(int _v,int _w,int _next){
		v=_v,w=_w,next=_next;
	};
	bool operator <(const Edge a)const{
		return w>a.w;
	};
}edge1[MAXN],edge2[MAXN];
int EdgeCount1,EdgeCount2,head1[MAXN],head2[MAXN];
int t,n,m,dis1[MAXN],dis2[MAXN];
bool used[MAXN];
void addEdge1(int u,int v,int w)	//建原图 
{
	edge1[++EdgeCount1]=Edge(v,w,head1[u]);
	head1[u]=EdgeCount1;
}
void addEdge2(int u,int v,int w)	//建反图 
{
	edge2[++EdgeCount2]=Edge(v,w,head2[u]);
	head2[u]=EdgeCount2;
}
void dijkstra1()	//求原图1到各点最小值 
{
	priority_queue<Edge> q;
	memset(dis1,0x3f,sizeof(dis1));
	memset(used,false,sizeof(used));
	dis1[1]=0;
	q.push(Edge{1,0,0});
	while(!q.empty()){
		int u=q.top().v;q.pop();
		if(used[u])continue;
		used[u]=true;
		for(int i=head1[u];i;i=edge1[i].next){
			int v=edge1[i].v,w=edge1[i].w;
			if(dis1[v]>dis1[u]+w){
				dis1[v]=dis1[u]+w;
				q.push(Edge{v,dis1[v],0});
			}
		}
	}
}
void dijkstra2()	//求反图1到各点最小值 
{
	priority_queue<Edge> q;
	memset(dis2,0x3f,sizeof(dis2));
	memset(used,false,sizeof(used));
	dis2[1]=0;
	q.push(Edge{1,0,0});
	while(!q.empty()){
		int u=q.top().v;q.pop();
		if(used[u])continue;
		used[u]=true;
		for(int i=head2[u];i;i=edge2[i].next){
			int v=edge2[i].v,w=edge2[i].w;
			if(dis2[v]>dis2[u]+w){
				dis2[v]=dis2[u]+w;
				q.push(Edge{v,dis2[v],0});
			}
		}
	}
}
int main()
{
	scanf("%d",&t);
	while(t--){
		memset(head1,0,sizeof(head1));	//初始化 
		memset(head2,0,sizeof(head2));
		EdgeCount1=EdgeCount2=0;
		scanf("%d%d",&n,&m);
		for(int i=1;i<=m;i++){
			int u,v,w; 
			scanf("%d%d%d",&u,&v,&w);
			addEdge1(u,v,w);	//原图添边
			addEdge2(v,u,w);	//反图添边 
		}
		dijkstra1();
		dijkstra2();
		int ans=0;
		for(int i=1;i<=n;i++)ans+=dis1[i]+dis2[i];
		printf("%d\n",ans);
	}
}

 

SPFA算法

#include <bits/stdc++.h>
#define MAXN 1000005
using namespace std;
struct Edge{	//链式前向星 
	int v,w,next;
	Edge(){};
	Edge(int _v,int _w,int _next){
		v=_v,w=_w,next=_next;
	};
}edge1[MAXN],edge2[MAXN];
int EdgeCount1,EdgeCount2,head1[MAXN],head2[MAXN];
int t,n,m,dis1[MAXN],dis2[MAXN];
bool ven[MAXN];
void addEdge1(int u,int v,int w)	//建原图 
{
	edge1[++EdgeCount1]=Edge(v,w,head1[u]);
	head1[u]=EdgeCount1;
}
void addEdge2(int u,int v,int w)	//建反图 
{
	edge2[++EdgeCount2]=Edge(v,w,head2[u]);
	head2[u]=EdgeCount2;
}
void SPFA1()	//求原图1到各点最小值 
{
	queue<int> q;
	memset(dis1,0x3f,sizeof(dis1));
	memset(ven,false,sizeof(ven));
	dis1[1]=0;
	q.push(1);
	while(!q.empty()){
		int u=q.front();q.pop();
		ven[u]=false;
		for(int i=head1[u];i;i=edge1[i].next){
			int v=edge1[i].v,w=edge1[i].w;
			if(dis1[v]>dis1[u]+w){
				dis1[v]=dis1[u]+w;
				if(!ven[v]){
					q.push(v);
					ven[v]=true;
				}
			}
		}
	}
}
void SPFA2()	//求反图1到各点最小值 
{
	queue<int> q;
	memset(dis2,0x3f,sizeof(dis2));
	memset(ven,false,sizeof(ven));
	dis2[1]=0;
	q.push(1);
	while(!q.empty()){
		int u=q.front();q.pop();
		ven[u]=false;
		for(int i=head2[u];i;i=edge2[i].next){
			int v=edge2[i].v,w=edge2[i].w;
			if(dis2[v]>dis2[u]+w){
				dis2[v]=dis2[u]+w;
				if(!ven[v]){
					q.push(v);
					ven[v]=true;
				}
			}
		}
	}
}
int main()
{
	scanf("%d",&t);
	while(t--){
		memset(head1,0,sizeof(head1));	//初始化 
		memset(head2,0,sizeof(head2));
		EdgeCount1=EdgeCount2=0;
		scanf("%d%d",&n,&m);
		for(int i=1;i<=m;i++){
			int u,v,w; 
			scanf("%d%d%d",&u,&v,&w);
			addEdge1(u,v,w);	//原图添边
			addEdge2(v,u,w);	//反图添边 
		}
		SPFA1();
		SPFA2();
		int ans=0;
		for(int i=1;i<=n;i++)ans+=dis1[i]+dis2[i];
		printf("%d\n",ans);
	}
}

 

SPFA算法之SLF优化

#include <bits/stdc++.h>
#define MAXN 1000005
using namespace std;
struct Edge{	//链式前向星 
	int v,w,next;
	Edge(){};
	Edge(int _v,int _w,int _next){
		v=_v,w=_w,next=_next;
	};
}edge1[MAXN],edge2[MAXN];
int EdgeCount1,EdgeCount2,head1[MAXN],head2[MAXN];
int t,n,m,dis1[MAXN],dis2[MAXN];
bool ven[MAXN];
void addEdge1(int u,int v,int w)	//建原图 
{
	edge1[++EdgeCount1]=Edge(v,w,head1[u]);
	head1[u]=EdgeCount1;
}
void addEdge2(int u,int v,int w)	//建反图 
{
	edge2[++EdgeCount2]=Edge(v,w,head2[u]);
	head2[u]=EdgeCount2;
}
void SPFA1()	//求原图1到各点最小值 
{
	deque<int> q;
	memset(dis1,0x3f,sizeof(dis1));
	memset(ven,false,sizeof(ven));
	dis1[1]=0;
	q.push_back(1);
	int cnt;
	while(cnt=q.size()){
		int u=q.front();q.pop_front();
		ven[u]=false;
		for(int i=head1[u];i;i=edge1[i].next){
			int v=edge1[i].v,w=edge1[i].w;
			if(dis1[v]>dis1[u]+w){
				dis1[v]=dis1[u]+w;
				if(!ven[v]){
					if(cnt>1&&dis1[v]>dis1[q.front()])q.push_front(v);
					else q.push_back(v);
					ven[v]=true;
				}
			}
		}
	}
}
void SPFA2()	//求反图1到各点最小值 
{
	deque<int> q;
	memset(dis2,0x3f,sizeof(dis2));
	memset(ven,false,sizeof(ven));
	dis2[1]=0;
	q.push_back(1);
	int cnt;
	while(cnt=q.size()){
		int u=q.front();q.pop_front();
		ven[u]=false;
		for(int i=head2[u];i;i=edge2[i].next){
			int v=edge2[i].v,w=edge2[i].w;
			if(dis2[v]>dis2[u]+w){
				dis2[v]=dis2[u]+w;
				if(!ven[v]){
					if(cnt>1&&dis2[v]>dis2[q.front()])q.push_front(v);
					else q.push_back(v);
					ven[v]=true;
				}
			}
		}
	}
}
int main()
{
	scanf("%d",&t);
	while(t--){
		memset(head1,0,sizeof(head1));	//初始化 
		memset(head2,0,sizeof(head2));
		EdgeCount1=EdgeCount2=0;
		scanf("%d%d",&n,&m);
		for(int i=1;i<=m;i++){
			int u,v,w; 
			scanf("%d%d%d",&u,&v,&w);
			addEdge1(u,v,w);	//原图添边
			addEdge2(v,u,w);	//反图添边 
		}
		SPFA1();
		SPFA2();
		int ans=0;
		for(int i=1;i<=n;i++)ans+=dis1[i]+dis2[i];
		printf("%d\n",ans);
	}
}