HDU3790 - 最短路径问题 - 最短路附加

1.题目描述：

最短路径问题

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 25786    Accepted Submission(s): 7695

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)

 

Output

输出 一行有两个数， 最短距离及其花费。

 

Sample Input

  
  

   
   3 2
1 2 5 6
2 3 4 5
1 3
0 0
  
  

 

Sample Output

  
  

   
   9 11
  
  

 

Source

浙大计算机研究生复试上机考试-2010年

 

Recommend

notonlysuccess   |   We have carefully selected several similar problems for you:   1142  1596  1690  2923  2433 

 

3.解题思路：

其实就是在最短路基础上多了一个花费，而且题目要求是最短路前提之下的最小花费，那么直接在更新dis基础上更新cost就好了。

4.AC代码：

#include <bits/stdc++.h>
#define INF 0x7fffffff
#define maxn 100100
#define N 1111
#define eps 1e-6
#define pi acos(-1.0)
#define e exp(1.0)
using namespace std;
const int mod = 1e9 + 7;
typedef long long ll;
typedef unsigned long long ull;
struct node
{
	int to, val, fee;
	node(int a, int b, int c) { to = a; val = b; fee = c; }
};
vector<node> mp[N];
int dis[N];
int cost[N];
bool vis[N];
void spfa(int sta, int n)
{
	memset(vis, 0, sizeof(vis));
	fill(dis, dis + n + 1, INF);
	fill(cost, cost + n + 1, INF);
	deque<node> q;
	vis[sta] = 1;
	dis[sta] = 0;
	cost[sta] = 0;
	q.push_back(node(sta, 0, 0));
	while (!q.empty())
	{
		int u = q.front().to;
		q.pop_front();
		vis[u] = 0;
		int sz = mp[u].size();
		for (int i = 0; i < sz; i++)
		{
			int v = mp[u][i].to;
			int w = mp[u][i].val;
			int x = mp[u][i].fee;
			if (dis[v] > dis[u] + w)
			{
				dis[v] = dis[u] + w;
				cost[v] = cost[u] + x;
				if (!vis[v])
				{
					vis[v] = 1;
					if (!q.empty() && dis[v] <= dis[q.front().to])
						q.push_front(node(v, dis[v], cost[v]));
					else
						q.push_back(node(v, dis[v], cost[v]));
				}
			}
			else if (dis[v] == dis[u] + w)
				cost[v] = min(cost[v], cost[u] + x);
		}
	}
}
int main()
{
#ifndef ONLINE_JUDGE
	freopen("in.txt", "r", stdin);
	freopen("out.txt", "w", stdout);
	long _begin_time = clock();
#endif
	int n, m;
	while (~scanf("%d%d", &n, &m), n + m)
	{
		for (int i = 1; i <= n; i++)
			mp[i].clear();
		for (int i = 0; i < m; i++)
		{
			int u, v, w, x;
			scanf("%d%d%d%d", &u, &v, &w, &x);
			mp[u].push_back(node(v, w, x));
			mp[v].push_back(node(u, w, x));
		}
		int s, t;
		scanf("%d%d", &s, &t);
		spfa(s, n);
		printf("%d %d\n", dis[t], cost[t]);
	}
#ifndef ONLINE_JUDGE
	long _end_time = clock();
	printf("time = %ld ms.", _end_time - _begin_time);
#endif
	return 0;
}