Pku oj 3311 Hie with the Pie(TSP问题)
来源:互联网 发布:网页美工的工作内容 编辑:程序博客网 时间:2024/06/06 01:20
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). Thejth 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 j via 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.
Sample Input
30 1 10 101 0 1 210 1 0 1010 2 10 00
Sample Output
8
#include<cstdio>#include<iostream>#include<algorithm>using namespace std;int map[12][12];int dp[1<<11][12];int n,ans,Min;const int Inf = 0x3f3f3f;int main(){ while(~scanf("%d",&n) && n) { for(int i=0;i<=n;i++) { for(int j=0;j<=n;j++) { scanf("%d",&map[i][j]); } } for(int k=0;k<=n;k++) { for(int i=0;i<=n;i++) { for(int j=0;j<=n;j++) { map[i][j] = min(map[i][j],map[i][k]+map[k][j]); } } } for(int s=0;s<=(1<<n)-1;s++) { for(int i=1;i<=n;i++) { if(s & (1<<(i-1))) { if(s == (1<<(i-1))) dp[s][i] = map[0][i]; else { dp[s][i] = Inf; for(int j=1;j<=n;j++) { if(s & (1<<(j-1)) && j != i) dp[s][i] = min(dp[s^(1<<(i-1))][j]+map[j][i],dp[s][i]); } } } } } ans = dp[(1<<n)-1][1] + map[1][0]; for(int i=2;i<=n;i++) { if(dp[(1<<n)-1][i] + map[i][0] < ans) ans = dp[(1<<n)-1][i] + map[i][0]; } printf("%d\n",ans); }}
- Pku oj 3311 Hie with the Pie(TSP问题)
- POJ 3311 Hie with the Pie(经典TSP问题)
- POJ 3311 Hie with the Pie(经典TSP问题)
- poj 3311 Hie with the Pie (TSP问题)
- 【DP】 POJ 3311 Hie with the Pie 状压 TSP问题
- POJ 3311 Hie with the Pie(TSP问题DP解)
- POJ 3311 Hie with the Pie TSP问题 -
- HDU 3311 Hie with the Pie(状压dp+TSP问题)
- poj 3311 Hie with the Pie (TSP)
- POJ 3311--Hie with the Pie(状压dp+TSP)
- Poj 3311 Hie with the Pie 状态压缩(TSP)
- poj 3311 Hie with the Pie(TSP ,状压dp)
- pku 3311 Hie with the Pie
- POJ 3311 Hie with the Pie(TSP问题 状压DP)
- POJ 3311 Hie with the Pie (状态压缩DP ,tsp问题)
- POJ 3311 Hie with the Pie (状态压缩DP ,TSP问题)
- POJ3311 Hie with the Pie(DP:TSP问题)
- POJ 3311 Hie with the Pie -- TSP 状态压缩dp
- Android错误处理——Android读取txt文件乱码解决方案
- java后台保存base64图片数据
- 认识CoreData—基础使用
- poj 2151 Check the difficulty of problems
- window 内核驱动开发环境配置
- Pku oj 3311 Hie with the Pie(TSP问题)
- 什么影响了mysql的性能?
- 安卓自定义View进阶-Matrix原理
- hdu 3081 Marriage Match II【并查集+二分匹配---匈牙利】
- 排序算法练习(快排&&堆排)——hdu 1040
- 串之字符串链接
- 认识CoreData—使用进阶
- xib传值
- CCS5.5环境下使用clock()函数测试程序段运行时间