题目链接:
https://vjudge.net/contest/159644#problem/D
题意:
n个点,给出m条边,每条边有一个边权,每个顶点可以走两次
问走遍所有点的最小花费
题解:
http://www.cnblogs.com/martinue/p/5490432.html
对于状态S,第i位为1表示已经走过
dp[S][v]:=在S这个状态,走到v所用的花费
转移: dp[i+three[k]][k] = min(dp[i+three[k]][k],dp[i][j]+g[j][k]);
代码:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MS(a) memset(a,0,sizeof(a))
#define MP make_pair
#define PB push_back
const int INF = 0x3f3f3f3f;
const ll INFLL = 0x3f3f3f3f3f3f3f3fLL;
inline ll read(){
ll x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
//////////////////////////////////////////////////////////////////////////
const int maxn = 60000;
int three[11];
int dp[maxn][11],digit[maxn][11];
int g[11][11];
int n,m;
void init(){
three[0] = 1;
for(int i=1; i<11; i++)
three[i] = three[i-1]*3;
for(int i=0; i<three[10]; i++){
int tmp = i;
for(int j=0; j<10; j++){
digit[i][j] = tmp%3;
tmp /= 3;
}
}
}
int main(){
init();
while(cin>>n>>m){
for(int i=0; i<n; i++)
for(int j=0; j<n; j++)
g[i][j] = INF;
for(int i=0; i<three[n]; i++)
for(int j=0; j<n; j++)
dp[i][j] = INF;
while(m --){
int u,v,w;
cin >> u >> v >> w;
g[u-1][v-1] = g[v-1][u-1] = min(w,g[u-1][v-1]);
}
for(int i=0; i<n; i++)
dp[three[i]][i] = 0;
int ans = INF;
for(int i=0; i<three[n]; i++){
bool flag = 1;
for(int j=0; j<n; j++){
if(digit[i][j] == 0) flag=0;
if(dp[i][j] != INF){
for(int k=0; k<n; k++)
if(g[j][k]!=INF && digit[i][k]!=2)
dp[i+three[k]][k] = min(dp[i+three[k]][k],dp[i][j]+g[j][k]);
}
}
if(flag){
for(int j=0; j<n; j++)
ans = min(dp[i][j],ans);
}
}
if(ans == INF) puts("-1");
else cout << ans << endl;
}
return 0;
}
// http://www.cnblogs.com/martinue/p/5490432.html