HDU 3001 Travelling(状态压缩dp)

题目分析

每个点最多走2遍，那么显然是3进制进行压缩，0表示没有走过，1表示走过一次，2表示走过2次，dp[i][j]表示状态为i是到达j点所需要的最小费用，运用我为人人的dp思想，找到现在状态能够到达的状态并更新能够到达的状态，知道满足条件的最小值即可。

#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 12;
const int INF = 0x3f3f3f3f;
int cost[maxn][maxn], dp[60000][maxn],fact[maxn],f[60000][maxn];

void init(){
    fact[1] = 1;
    for(int i = 2; i < maxn; i++)
        fact[i] = 3*fact[i-1];
    memset(f, 0, sizeof(f));
    for(int i = 0; i < 60000; i++){
        int temp = i;
        for(int j = 1; j < maxn; j++){
            f[i][j] = temp%3;
            temp /= 3;
            if(!temp) break;
        }
    }
}

int main(){
    int n,m;
    init();
    while(scanf("%d%d", &n, &m) != EOF){
        int from, to, w;
        memset(cost, INF, sizeof(cost));
        while(m--){
            scanf("%d%d%d", &from, &to, &w);
            if(w < cost[from][to]) cost[from][to] = cost[to][from] = w;
        }
        memset(dp, INF, sizeof(dp));
        for(int i = 1; i <= n; i++) dp[fact[i]][i] = 0;  //初始状态
        int ans = INF;
        for(int i = 0; i < fact[n+1]; i++){ //我为人人型dp
            int vis = 1;
            for(int j = 1; j <= n; j++){
                if(f[i][j] == 0) vis = 0;
                if(dp[i][j] == INF) continue;
                for(int k = 1; k <= n; k++){
                    if(j == k || cost[j][k] == INF || f[i][k] >= 2) continue;
                    int ii = i+fact[k];
                    dp[ii][k] = min(dp[ii][k], dp[i][j] + cost[j][k]);
                }
            }
            if(vis){
                for(int j = 1; j <= n; j++)
                    ans = min(ans, dp[i][j]);
            }
        }
        if(ans == INF) printf("-1\n");
        else printf("%d\n", ans);
    }
    return 0;
}