HDU 3001 Travelling (三进制状压DP)

来源:互联网 发布:linux 密码修改 编辑:程序博客网 时间:2024/05/26 04:39


Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 7905    Accepted Submission(s): 2588

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.

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 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

2009 Multi-University Training Contest 11 - Host by HRBEU




dp[i][j]表示状态为i,终点为j时的the minimum fee

#include <stdio.h>#include <string.h>#include <math.h>#include <algorithm>#define mod 100000000int const inf=1000000000;using namespace std;int dp[60000][20],w[60000][20],s[20],dis[20][20],n,m;int main (){int i,j,k;s[0]=1;for(i=1;i<=10;i++)s[i]=s[i-1]*3;for(i=0;i<s[10];i++){int t=i;for(j=0;j<10;j++){w[i][j]=t%3;t/=3;}}int a,b,c;while(scanf("%d %d",&n,&m)!=EOF){int ans=inf;for(i=0;i<15;i++)for(j=0;j<15;j++)dis[i][j]=inf;for(i=1;i<=m;i++){scanf("%d %d %d",&a,&b,&c);a--;b--;dis[a][b]=dis[b][a]=min(dis[a][b],c);}for(i=0;i<s[n];i++)for(j=0;j<10;j++)dp[i][j]=inf;for(i=0;i<n;i++)dp[s[i]][i]=0;for(i=0;i<s[n];i++){int flag=0;for(j=0;j<n;j++){if(w[i][j]==0)flag=1;if(dp[i][j]==inf)continue;for(k=0;k<n;k++){if(dis[j][k]==inf || w[i][k]==2)continue;int t=i+s[k];dp[t][k]=min(dp[t][k],dp[i][j]+dis[j][k]);}}if(flag==0){for(j=0;j<n;j++){ans=min(ans,dp[i][j]);}}}if(ans==inf)ans=-1; printf("%d\n",ans);}return 0;}