DP三进制状态压缩:Travelling
来源:互联网 发布:打码兔软件下载 编辑:程序博客网 时间:2024/05/01 19:25
B - Travelling
Time Limit:3000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescription
After coding so many days,Mr Acmer wants to have a good rest.So travelling is the best choice!He has decided to visit n cities(he insists on seeing all the cities!And he does not mind which city being his start station because superman can bring him to any city at first but only once.), and of course there are m roads here,following a fee as usual.But Mr Acmer gets bored so easily that he doesn't want to visit a city more than twice!And he is so mean that he wants to minimize the total fee!He is lazy you see.So he turns to you for help.
Input
There are several test cases,the first line is two intergers n(1<=n<=10) and m,which means he needs to visit n cities and there are m roads he can choose,then m lines follow,each line will include three intergers a,b and c(1<=a,b<=n),means there is a road between a and b and the cost is of course c.Input to the End Of File.
Output
Output the minimum fee that he should pay,or -1 if he can't find such a route.
Sample Input
2 11 2 1003 21 2 402 3 503 31 2 31 3 42 3 10
Sample Output
100907
#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> #include <string> using namespace std; #define INF 1<<31-1 int tri[12]= {0,1,3,9,27,81,243,729,2187,6561,19683,59049};//三进制1表示去过一次,2表示2次,0表示没去过 int dp[59050][12]; int dig[59050][12];//状态i是0到59049,j是城市编号,dig[i][j]指的是状态为i时城市j被访问了多少遍 int edge[12][12]; int main(){ int n, m; int i, j; int ans; for(i = 0; i < 59050; i ++){ int tmp = i; for(j = 1; j <= 10; j ++){ dig[i][j] = tmp % 3; tmp = tmp/3; } } while(cin >> n >> m){ ans = INF; for(i = 1; i <= n; i ++){ for(j = 1; j <= n; j ++) edge[i][j] = INF; } for(i = 0; i < tri[n+1]; i ++){ for(j = 1; j <= n; j ++){ dp[i][j] = INF; } } for(i = 1; i <= 10; i ++){ dp[tri[i]][i] = 0;//边界条件,状态为只遍历了i城且身处在i城时走过的路为0 } for(i = 1; i <= m; i ++){ int a, b, c; scanf("%d %d %d", &a, &b, &c); if(edge[a][b] > c){ edge[a][b] = c; edge[b][a] = c; } } for(int s = 0; s < tri[n+1]; s ++){ int vis_all = 1;//判断在这种情况是有效的,所有城市都被访问了 for(i = 1; i <= n; i ++){ if(dig[s][i] == 0) vis_all =0;//S状态下i城没访问过,则S不能作为终状态 if(dp[s][i] == INF) continue; for(j = 1; j <= n; j ++){ if(i == j) continue; if(edge[i][j] == INF || dig[s][j] == 2)//i与j相等或者i走不到j或者j城已走过两遍 continue; int ns = s + tri[j]; dp[ns][j] = min(dp[ns][j], dp[s][i] + edge[i][j]); } } if(vis_all) for(j = 1; j <= n; j ++){ ans = min(ans, dp[s][j]);//S能作为终状态时,比较落脚在那个点要走的路最少 } } if(ans == INF) cout << "-1" << endl; else cout << ans << endl; } return 0; }
- DP三进制状态压缩:Travelling
- hdu3001 Travelling(状态压缩dp,三进制)
- hdu3001 Travelling 三进制状态压缩dp
- HDU 3001 Travelling (三进制状态压缩DP+BFS)
- hdu 3001 Travelling (状态压缩dp-----模拟三进制)
- HDU 3001 Travelling (三进制状态压缩 DP)
- hdu 3001 Travelling (状态压缩dp,三进制!)
- hdu 3001 Travelling//状态压缩DP
- HDU 3001 Travelling (状态压缩DP)
- HDU 3001 Travelling(DP状态压缩)
- HDU 3001 Travelling(状态压缩dp)
- HDU 3001 Travelling(状态压缩DP)
- HDU 3001 Travelling(状态压缩dp)
- hdu 3001 Travelling(状态压缩dp)
- hdu3001 Travelling 三进制状态压缩
- Hdu 3301 Travelling 状态压缩(三进制)
- Travelling HDU - 3001(三进制状态压缩) 题解
- HDU3001-Travelling-状态压缩
- 点滴穿石
- 有参构造函数和无参构造函数
- RyMiniFramework(4)-引导界面
- 算法时间复杂度计算
- Page.ClientScript.RegisterClientScriptBlock 之间的区别
- DP三进制状态压缩:Travelling
- ubuntu管理员省份登入
- sealed、new、virtual、abstract与override 总结
- SQL Server 2008 收缩日志清空删除大日志文件
- some summary of basic linux
- 在linux下如何将ttyS0改成别的号,比如ttyS4什么的,我的系统只有一个串口。
- Windows下PCI9054驱动程序开发环境搭建及常见问题解决
- 介绍大家一个异步加载图片的公用类: EGOImageLoading
- 八大排序(Java实现)