poj 3311 状压dp+float
来源:互联网 发布:收银软件交流群 编辑:程序博客网 时间:2024/06/14 16:28
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
30 1 10 101 0 1 210 1 0 1010 2 10 00
Sample Output
8
Source
#include<stdio.h>#include<string.h>#include<algorithm>#define inf 0x3f3f3f3fusing namespace std;int maps[1003][1003];int dp[1<<12][20];int main(){ int n; while(scanf("%d",&n),n) { memset(maps,0,sizeof(maps)); memset(dp,0,sizeof(dp)); for(int i=0; i<=n; i++) { for(int j=0; j<=n; j++) { scanf("%d",&maps[i][j]); } } for(int k=0; k<=n; k++) { for(int i=0; i<=n; i++) { for(int j=0; j<=n; j++) { maps[i][j]=min(maps[i][j],maps[i][k]+maps[k][j]); } } } for(int i=0; i<(1<<n); i++) { for(int j=0; j<=n; j++) { if(i&1<<(j-1)) { if(i==(1<<(j-1))) dp[i][j]=maps[0][j]; else { dp[i][j]=inf; for(int k=0;k<=n;k++) { if(k!=j&&(i&1<<(k-1))) { dp[i][j]=min(dp[i][j],dp[i^(1<<(j-1))][k]+maps[k][j]); } } } } } } int res=inf; for(int i=1;i<=n;i++) res=min(res,dp[(1<<n)-1][i]+maps[i][0]); printf("%d\n",res); }}
- poj 3311 状压dp+float
- poj 3311 状压DP
- poj 3311 送披萨 状压dp
- POJ 2923 状压DP
- POJ 2411-状压dp
- POJ 3254-状压dp
- poj 1185(状压dp)
- POJ 1185 状压DP
- POJ 3254 状压DP
- poj 1185 状压DP
- POJ 1038 状压DP
- POJ 3254 状压DP
- POJ 1185 状压DP
- poj 1185 状压DP
- poj 3254 状压DP
- poj 2686 状压dp
- POJ 2686 状压dp
- POJ 3254 状压dp
- 关于 Android 7.0 适配中 FileProvider 部分的总结
- flex布局(笔记)
- ActivePerl、dmake、nasm、nmake编译OpenSSL(1.1.0系列)
- 2.13navigation导航系统
- linux安装MySQL出现ERROR 1045 (28000): Access denied for user 'root'@'localhost' (using password: YES)
- poj 3311 状压dp+float
- 用c实现strstr函数(子字符串查找)功能
- 操作系统牛客网刷题
- inline用法详解
- 欢迎使用CSDN-markdown编辑器
- 2.14 unity特效渲染
- FTP,SFTP,FTPS区别
- 一帧之内删除所有子级
- (1) racecar零件购买