1030 Travel Plan (30 分)

1030 Travel Plan (30 分)

A traveler’s map gives the distances between cities along the highways, together with the cost of each highway. Now you are supposed to write a program to help a traveler to decide the shortest path between his/her starting city and the destination. If such a shortest path is not unique, you are supposed to output the one with the minimum cost, which is guaranteed to be unique.
Input Specification:

Each input file contains one test case. Each case starts with a line containing 4 positive integers N, M, S, and D, where N (≤500) is the number of cities (and hence the cities are numbered from 0 to N−1); M is the number of highways; S and D are the starting and the destination cities, respectively. Then M lines follow, each provides the information of a highway, in the format:

City1 City2 Distance Cost

where the numbers are all integers no more than 500, and are separated by a space.

Output Specification:

For each test case, print in one line the cities along the shortest path from the starting point to the destination, followed by the total distance and the total cost of the path. The numbers must be separated by a space and there must be no extra space at the end of output.

Sample Input:

4 5 0 3
0 1 1 20
1 3 2 30
0 3 4 10
0 2 2 20
2 3 1 20

Sample Output:

0 2 3 3 40

这题是对Dij算法的简单变形，相当于又加了一层标尺，既要判断最短路还要判断如果路径长度一样再去判断花费是否最小，既要求最短路径还需要最小花费，在记录路径时设置一个r数组每次标记他的父节点，最后递归输出即可。

#include<bits/stdc++.h>

using namespace std;

const int maxn = 1e4+5;
const int inf = 0x3f3f3f3f;
int dis[maxn],c[maxn],r[maxn];
bool vis[maxn];
int st,ed,n,m;

struct node
{
	int u,w,val;
	node(int uu , int ww , int vall):u(uu),w(ww),val(vall){}
	friend bool operator <(node a , node b)
	{
		return a.w > b.w;
 	} 
};
vector<node>e[maxn];
priority_queue<node>pque;

void add_edge(int u , int v , int w , int val)
{
	e[u].push_back(node(v,w,val));
}
void Dij(int st , int ed)
{
	fill(vis,vis+maxn,false);
	fill(dis,dis+maxn,inf);
	fill(c,c+maxn,inf);
	c[st] = 0;
	dis[st] = 0;
	pque.push(node(st,0,0));
	while(!pque.empty())
	{
		node t = pque.top();
		pque.pop();
		int u = t.u;
		if(vis[u])
			continue;
		vis[u] = true;
		for(int i = 0 ; i < e[u].size() ; i++)
		{
			int v = e[u][i].u;
			int w = e[u][i].w;
			int val = e[u][i].val;
			if(!vis[v] && dis[v] > dis[u] + w)
			{
				dis[v] = dis[u] + w;
				r[v] = u;
				c[v] = c[u] + val;
				pque.push(node(v,dis[v],c[v]));
			}
			else if(!vis[v] && dis[v] == dis[u] + w)
			{
				if(c[v] > c[u] + val)
				{
					c[v] = c[u] + val;
					r[v] = u;
					pque.push(node(v,dis[v],c[v]));
				}
			}
		}
	}
}

void prinf(int x)
{
	if(x == st)
	{
		cout << x << " ";
		return;
	}
	prinf(r[x]);
	cout << x << " ";
}

int main()
{
	cin >> n >> m >> st >> ed;
	for(int i = 0 ; i < m ; i++)
	{
		int u,v,w,val;
		cin >> u >> v >> w >> val;
		add_edge(u,v,w,val);
		add_edge(v,u,w,val);
	}
	Dij(st,ed);
	prinf(ed);
	cout << dis[ed] << " " << c[ed] << endl;
	return 0;
}