首页 > 代码库 > HDU 3001 三进制 状压dp
HDU 3001 三进制 状压dp
Travelling
Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3789 Accepted Submission(s): 1182
Problem Description
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
Source
2009 Multi-University Training Contest 11 - Host by HRBEU
Recommend
gaojie
转自：http://blog.csdn.net/azheng51714/article/details/7773862
题意：
ACMer 想要游玩n个城市，告诉我们每个城市间的旅行费用，并且要求每个城市最多走两遍！问最小花费是多少 ？！
思路：
典型的TSP问题，唯一的变化就是走两遍！
解法：
利用三进制将边点j 在点集i 出现的次数表示成 tir[i][j];
1 #include<iostream> 2 #include<cstring> 3 #include<cstdlib> 4 #include<cstdio> 5 #include<algorithm> 6 #include<cmath> 7 #include<queue> 8 #include<map> 9 #include<vector> 10 #include<set> 11 12 #define N 1005 13 #define M 100000 14 #define inf 1000000007 15 #define mod 1000000007 16 #define mod2 100000000 17 #define ll long long 18 #define maxi(a,b) (a)>(b)? (a) : (b) 19 #define mini(a,b) (a)<(b)? (a) : (b) 20 21 using namespace std; 22 23 int n; 24 int m; 25 int tri[12] ={0,1,3,9,27,81,243,729,2187,6561,19683,59049}; 26 int dig[59050][11]; //dig[state][k_dig] 状态state的第k位是多少 27 int dp[59050][11]; 28 int d[15][15]; 29 int ans; 30 int flag; 31 32 void ini1() 33 { 34 int o,j,t; 35 for(o=0;o<59049;o++){ 36 t=o; 37 for(j=0;j<10;j++){ 38 dig[o][j]=t%3; 39 t/=3; 40 } 41 } 42 } 43 44 void ini() 45 { 46 int a,b; 47 int c; 48 int i; 49 ans=-1; 50 memset(dp,-1,sizeof(dp)); 51 memset(d,-1,sizeof(d)); 52 while(m--){ 53 scanf("%d%d%d",&a,&b,&c); 54 if(d[a][b]==-1){ 55 d[a][b]=c; 56 d[b][a]=c; 57 } 58 else{ 59 d[a][b]=min(d[a][b],c); 60 d[b][a]=min(d[b][a],c); 61 } 62 } 63 64 for(i=1;i<=n;i++){ 65 dp[ tri[i] ][i-1]=0; 66 } 67 } 68 69 void solve() 70 { 71 int o,j,te,k; 72 for(o=1;o<tri[n+1];o++){ 73 flag=1; 74 for(j=0;j<n;j++){ 75 if(dig[o][j]==0){ 76 flag=0;continue; 77 } 78 te=o-tri[j+1]; 79 for(k=0;k<n;k++){ 80 if(dig[te][k]==0) continue; 81 if(d[k+1][j+1]==-1) continue; 82 if(dp[te][k]==-1) continue; 83 if(dp[o][j]==-1){ 84 dp[o][j]=dp[te][k]+d[k+1][j+1]; 85 } 86 else{ 87 dp[o][j]=min(dp[o][j],dp[te][k]+d[k+1][j+1]); 88 } 89 } 90 } 91 92 // printf(" o=%d flag=%d\n",o,flag); 93 if(flag==0) continue; 94 for(j=0;j<n;j++){ 95 if(dp[o][j]==-1) continue; 96 if(ans==-1){ 97 ans=dp[o][j]; 98 } 99 else{100 ans=min(ans,dp[o][j]);101 }102 }103 104 }105 }106 107 void out()108 {109 //for(int o=0;o<tri[n+1];o++){110 // for(int j=0;j<n;j++) printf(" o=%d j=%d dp=%d\n",o,j,dp[o][j]);111 // }112 printf("%d\n",ans);113 }114 115 int main()116 {117 ini1();118 //freopen("data.in","r",stdin);119 //freopen("data.out","w",stdout);120 //scanf("%d",&T);121 // for(int cnt=1;cnt<=T;cnt++)122 // while(T--)123 while(scanf("%d%d",&n,&m)!=EOF)124 {125 ini();126 solve();127 out();128 }129 return 0;130 }
HDU 3001 三进制 状压dp
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。