PKU 3311 Hie with the Pie 最短路 folyd

题意/Description：

The Pizazz Pizzeria prides itself in delivering pizzas to its customers as fast as possible. Unfortunately, due to cutbacks, they can afford to hire only one driver to do the deliveries. He will wait for 1 or more (up to 10) orders to be processed before he starts any deliveries. Needless to say, he would like to take the shortest route in delivering these goodies and returning to the pizzeria, even if it means passing the same location(s) or the pizzeria more than once on the way. He has commissioned you to write a program to help him.

读入/Input：

Input will consist of multiple test cases. The first line will contain a single integer n indicating the number of orders to deliver, where 1 ≤ n ≤ 10. After this will be n + 1 lines each containing n + 1 integers indicating the times to travel between the pizzeria (numbered 0) and the n locations (numbers 1 to n). The jth value on the ith line indicates the time to go directly from location i to location j without visiting any other locations along the way. Note that there may be quicker ways to go from i to jvia other locations, due to different speed limits, traffic lights, etc. Also, the time values may not be symmetric, i.e., the time to go directly from location i to j may not be the same as the time to go directly from location j to i. An input value of n = 0 will terminate input.

输出/Output：

For each test case, you should output a single number indicating the minimum time to deliver all of the pizzas and return to the pizzeria.

题解/solution：

这题听一个姓刘的说，要用folyd+状态压缩DP，听起来好恐怖。给出DP式子：

f[k,i]:=f[k xor (1 shl (i-1)),j]+a[j,i]; (k xor (1 shl (i-1))<>0)，((1 shl (j-1))<>0)

乍一看真的好恐怖。

解释一下：DP式子指：在没经过城市I的状态中，寻找合适的中间点J使得距离更短，和FLOYD一样。

条件是指：状态S中已经过城市i ，枚举不是城市I的其他城市。

然后自己敲吧。

代码/Code：

(部分程序)

procedure main;
varj,i,k:longint;
beginfillchar(f,sizeof(f),$7f);f[0,1]:=0;for k:=0 to 1 shl n-1 dobeginfor i:=1 to n dobeginif k=1 shl (i-1) then f[k,i]:=a[0,i];if (k and (1 shl (i-1)))<>0 thenbeginfor j:=1 to n doif (k xor (1 shl (i-1))<>0) and ((1 shl (j-1))<>0) thenif f[k xor (1 shl (i-1)),j]+a[j,i]<f[k,i] thenf[k,i]:=f[k xor (1 shl (i-1)),j]+a[j,i];end;end;end;
end;procedure print;
vari:longint;
beginans:=maxlongint;for i:=1 to n doif ans>f[1 shl n-1,i]+a[i,0] then ans:=f[1 shl n-1,i]+a[i,0];writeln(ans);
end;

PKU 3311 Hie with the Pie 最短路 folyd相关推荐

[POJ 3311] Hie with the Pie
这是状压DP中常见的一类问题(TSP问题)(废话) 题目大意: 给你一个n+1个点的有向完全图,现在要你从0号节点出发走过1-n号点至少一次,再返回0号点的最少时间,1<=n<=10 题意 ...
POJ 3311 Hie with the Pie (flyod + DFS枚举)
先用floyd算法求出 2点间的最短距离,然后再用深搜枚举即可. #include<cstdio> #include<cstring> #include<iostream ...
POJ - 3311 Hie with the Pie
题目: The Pizazz Pizzeria prides itself in delivering pizzas to its customers as fast as possible. Unf ...
Hie with the Pie（Floyd 状压DP）
POJ 3311 Hie with the Pie 题目大意一个披萨店要请司机来送披萨,这家店最多接受10个订单,由于预算的问题,只能雇佣一名司机,要求用最短的时间,从披萨店出发送完最后再回到披萨店 ...
【POJ 3311】Hie with the Pie（状压DP）
Hie with the Pie 题目链接:POJ 3311 题目大意给你 n+1 个点,其中 0 号点是特殊点. 然后两个点之间都有路径可以走. 然后你要从特殊点出发走过所有点回到特殊点,问你最短 ...
Hie with the Pie（poj3311）
题目链接:http://poj.org/problem?id=3311 学习博客:https://blog.csdn.net/u013480600/article/details/19692985 H ...
Hie with the Pie(旅行商问题)
Hie with the Pie 题目链接 Description The Pizazz Pizzeria prides itself in delivering pizzas to its cust ...
Hie with the Pie
Hie with the Pie poj-3311 题目大意:n+1个点,伪旅行商问题. 注释:n<=10. 想法:咳咳,第一道状压dp,下面我来介绍一下状压dp. 所谓dp,就是动态性决策规划 ...
【POJ P3311】【状压DP】Hie with the Pie
Hie with the Pie 题目解题思路 Code POJ P3311 Hie with the Pie 题目 Description The Pizazz Pizzeria prides i ...

PKU 3311 Hie with the Pie 最短路 folyd

PKU 3311 Hie with the Pie 最短路 folyd相关推荐

最新文章

热门文章