【1】【状压DP】POJ3311 Hie with the Pie
来源:互联网 发布:linux vi编辑怎么换行 编辑:程序博客网 时间:2024/06/11 11:01
Hie with the Pie
Time Limit: 2000MS Memory Limit: 65536K
Total Submissions: 6436 Accepted: 3470
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 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
3
0 1 10 10
1 0 1 2
10 1 0 10
10 2 10 0
0
Sample Output
8
#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>using namespace std;const int INF=1000000+5;int dis[20][20],map[20][20],dp[1000][30];void floyd(int n){ for(int i=0;i<=n;i++) for(int j=0;j<=n;j++) { scanf("%d",&map[i][j]); dis[i][j]=map[i][j]; } for(int i=0;i<=n;i++) for(int j=0;j<=n;j++) for(int k=0;k<=n;k++) { if(dis[i][j]>dis[i][k]+dis[k][j]) dis[i][j]=dis[i][k]+dis[k][j]; }}int main(){ int n; while(~scanf("%d",&n)&&n) { floyd(n); for(int s=0;s<(1<<n);s++){ for(int j=1;j<=n;j++){ if(s&(1<<(j-1))){ if(s==(1<<(j-1)))dp[s][j]=dis[0][j]; else { dp[s][j]=INF; for(int i=1;i<=n;i++) { if(s&1<<(i-1)&&i!=j) dp[s][j]=min(dp[s][j],dp[s^(1<<(j-1))][i]+dis[i][j]); } } } } } int ans=INF; for(int i=1;i<=n;i++){ if(dp[(1<<n)-1][i]+dis[i][0]<ans)ans=dp[(1<<n)-1][i]+dis[i][0]; } printf("%d\n",ans); } return 0;}
- poj3311(Hie with the Pie)状压dp
- POJ3311 Hie with the Pie 状压DP
- [POJ3311] Hie with the Pie && 状压DP
- [ 状压DP][POJ3311] Hie with the Pie
- 【1】【状压DP】POJ3311 Hie with the Pie
- poj3311--Hie with the Pie(状压dp)
- POJ3311 Hie with the Pie 【TSP】【状压dp】
- poj3311 Hie with the Pie
- POJ3311 Hie with the Pie
- poj3311 Hie with the Pie
- poj3311 Hie with the Pie
- Hie with the Pie poj3311
- POJ3311 Hie with the Pie
- POJ3311 Hie with the Pie(状态压缩dp)
- POJ3311:Hie with the Pie(floyd+状态压缩DP)
- poj3311 Hie with the Pie(最短路+状态dp)
- 【POJ3311】Hie with the Pie(状态压缩DP)
- poj3311 Hie with the Pie(状态压缩dp)
- C语言中比较好的方法
- 汇编指令
- POJ - 3311 Hie with the Pie
- 使用官方 docker registry 搭建私有镜像仓库及部署 web ui
- nyoj 860 又见01背包(01 背包)
- 【1】【状压DP】POJ3311 Hie with the Pie
- 学习用例:js中回文的处理
- Hadoop:HDFS文件存取机制
- ld: cannot find -lc
- ContextLoaderListener和Spring MVC中的DispatcherServlet加载内容的区别
- Pro JPA2读书笔记系列(十一)-第十章(高级对象-关系映射)
- 获取字符中Url地址
- SVN建立分支和合并代码
- 网络请求xml PULL解析