Travelling HDU - 3001(三进制状态压缩) 题解

最新推荐文章于 2020-03-27 12:51:45 发布

VIP文章 Sega_hsj

最新推荐文章于 2020-03-27 12:51:45 发布

阅读量417

点赞数

分类专栏： dp 文章标签：状态压缩 dp 三进制

本文链接：https://blog.csdn.net/hsj970319/article/details/56050537

版权

题目：
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 1
1 2 100
3 2
1 2 40
2 3 50
3 3
1 2 3
1 3 4
2 3 10
Sample Output
100
90
7

题目大意就是可以免费从任意点出发，每个点最多只能取两次，求走完所有点得最少消耗。
本来如果每个点只能去一次的话，用二进制串转十进制来保存就可以很轻松处理出来，用dp[i][j]表示走过的得集合得十进制状态表示为i，终点为j的最小消耗，但是因为每个点可以到达两次，状态压缩就得变成三进制了，状态x的三进制第i位为1时表示该点到达过一次，2表示到达过两次。终末状态也变成了从每