UVA 11374 Airport Express SPFA||dijkstra

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2369

Description

Problem D: Airport Express

In a small city called Iokh, a train service, Airport-Express, takes residents to the airport more quickly than other transports. There are two types of trains in Airport-Express, the Economy-Xpressand the Commercial-Xpress. They travel at different speeds, take different routes and have different costs.

Jason is going to the airport to meet his friend. He wants to take the Commercial-Xpress which is supposed to be faster, but he doesn't have enough money. Luckily he has a ticket for the Commercial-Xpress which can take him one station forward. If he used the ticket wisely, he might end up saving a lot of time. However, choosing the best time to use the ticket is not easy for him.

Jason now seeks your help. The routes of the two types of trains are given. Please write a program to find the best route to the destination. The program should also tell when the ticket should be used.

Input

The input consists of several test cases. Consecutive cases are separated by a blank line.

The first line of each case contains 3 integers, namely N, S and E (2 ≤ N ≤ 500, 1 ≤ S, E ≤ N), which represent the number of stations, the starting point and where the airport is located respectively.

There is an integer M (1 ≤ M ≤ 1000) representing the number of connections between the stations of the Economy-Xpress. The next Mlines give the information of the routes of the Economy-Xpress. Each consists of three integers X, Y and Z (X, Y ≤ N, 1 ≤ Z ≤ 100). This means X and Y are connected and it takes Z minutes to travel between these two stations.

The next line is another integer K (1 ≤ K ≤ 1000) representing the number of connections between the stations of the Commercial-Xpress. The next K lines contain the information of the Commercial-Xpress in the same format as that of the Economy-Xpress.

All connections are bi-directional. You may assume that there is exactly one optimal route to the airport. There might be cases where you MUST use your ticket in order to reach the airport.

Output

For each case, you should first list the number of stations which Jason would visit in order. On the next line, output "Ticket Not Used" if you decided NOT to use the ticket; otherwise, state the station where Jason should get on the train of Commercial-Xpress. Finally, print the total time for the journey on the last line. Consecutive sets of output must be separated by a blank line.

Sample Input

4 1 4
4
1 2 2
1 3 3
2 4 4
3 4 5
1
2 4 3

Sample Output

1 2 4
2
5

---

Problemsetter: Raymond Chun
Originally appeared in CXPC, Feb. 2004

题目大意：

机场快线分为经济线和商业线。两种路线价格、路线、速度不同。给你初始地点和目标地点，还有所有的经济线和商业线，要你求出从到目标地点最快的路线，这条路线有一个要求就是最多坐一条商业线，当然也可以不做，速度最快就好。

要求输出所经过的路径、在哪个站点使用商业线、以及总的时间。

思路：

我们可以先调用两次dijkstra或者两次SPFA，求出起点和终点到所有点的最短路径，然后商业线一一枚举。

example:

INPUT:

5 5 1
3
1 2 4
2 3 4
3 4 4
5
1 2 2
2 3 2
1 3 2
2 4 2
4 5 10
OUT:

5 4 3 2 1
5
22

判断商业线的时候，要特别注意。看下面的代码，要判断双向的。我一开始一直WA就是这样。。

dijkstra版本:0.019s

#include
#include
#include
const int INF=999999;
const int MAXN=520;
const int MAXM=2520;
using namespace std;
struct edge
{
	int to;
	int val;
	int next;
}e[MAXM];

struct node
{
	int from;
	int val;
	node(int f,int v){from=f;val=v;}
	bool operator < (const node& b)const  
    {  
        return val > b.val;  
    }  
};

int head[MAXN],len;
int dis_s[MAXN],dis_r[MAXN],path_s[MAXN],path_r[MAXN];

void add(int from,int to,int val)
{
	e[len].to=to;
	e[len].val=val;
	e[len].next=head[from];
	head[from]=len++;
}

int n,s,en;
void dijkstra(int start,int dis[],int path[])
{
	bool vis[MAXN]={0};
	dis[start]=0;

	priority_queue q;
	q.push(node(start,0));
	int num=0;
	while(!q.empty())
	{
		node temp=q.top();
		q.pop();

		if(vis[temp.from])
			continue;

		vis[temp.from]=true;

		if(num==n)
			break;
		for(int i=head[temp.from];i!=-1;i= e[i].next)
		{
			if( !vis[e[i].to] &&
				dis[temp.from] + e[i].val < dis[e[i].to])
			{
				dis[e[i].to]=dis[temp.from] + e[i].val ;
				path[e[i].to] = temp.from;
				q.push(node(e[i].to,dis[e[i].to]));
			}
		}
	}
}

void print(int cur)
{
	if(path_s[cur]!=-1)
		print(path_s[cur]);

	if(cur!=en)
		printf("%d ",cur);
	else
		printf("%d\n",cur);
}
int main()
{
	bool not_first=false;
	while(~scanf("%d%d%d",&n,&s,&en))
	{
		if(not_first)
			printf("\n");
		not_first=true;


        len=0;  
		for(int i=1;i<=n;i++)
		{
			dis_s[i]=dis_r[i]=INF;
			head[i]=path_r[i]=path_s[i]=-1;
		}

		int m;
		scanf("%d",&m);
		for(int i=0;i

采用SLF优化的SPFA版本：0.015s

#include
#include
#include
const int INF=999999;
const int MAXN=520;
const int MAXM=2520;
using namespace std;
struct edge
{
	int to;
	int val;
	int next;
}e[MAXM];

int head[MAXN],len;
int dis_s[MAXN],dis_r[MAXN],path_s[MAXN],path_r[MAXN];

void add(int from,int to,int val)
{
	e[len].to=to;
	e[len].val=val;
	e[len].next=head[from];
	head[from]=len++;
}

int n,s,en;
void SPFA(int start,int dis[],int path[])
{
	bool vis[MAXN]={0};
	dis[start]=0;

	deque q;
	q.push_back(start);
	vis[start]=true;
	while(!q.empty())
	{
		int cur=q.front();
		q.pop_front();
		vis[cur]=false;
		for(int i=head[cur];i!=-1;i=e[i].next)
		{
			int id=e[i].to;
			if( dis[cur] + e[i].val < dis[id] )
			{
				path[id]=cur;
				dis[id]=dis[cur] + e[i].val;
				if(!vis[id])
				{
					if(!q.empty() && dis[id]