HDU 3768 Shopping 最短路+状压dp

dp[j][i] 表示在第j个商店，i表示是否去过商店的状态

#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <bitset>
#include <list>
#include <stdexcept>
#include <functional>
#include <utility>
#include <ctime>

using namespace std;

#define PB push_back
#define MP make_pair
#define REP(i,n) for(int i=0;i<(n);++i)
#define FOR(i,l,h) for(int i=(l);i<=(h);++i)
#define DWN(i,h,l) for(int i=(h);i>=(l);--i)
#define CLR(vis) memset(vis,0,sizeof(vis))
#define MST(vis,pos) memset(vis,pos,sizeof(vis))
#define MAX3(a,b,c) max(a,max(b,c))
#define MAX4(a,b,c,d) max(max(a,b),max(c,d))
#define MIN3(a,b,c) min(a,min(b,c))
#define MIN4(a,b,c,d) min(min(a,b),min(c,d))
#define PI acos(-1.0)
#define INF 1e9
#define LINF 1000000000000000000LL
#define eps 1e-8

typedef long long ll;

const int maxn=1e5+5;

struct node{
    int w,to,next;
}e[maxn*4];

int head[maxn],dis[22][maxn];
int edge,n,m;
bool vis[maxn];
int t;
int shop[22];

void init()
{
    edge=0;
    MST(head,-1);
    CLR(shop);
}

void add(int u,int v,int c)
{
    e[edge].to=v,e[edge].w=c,e[edge].next=head[u],head[u]=edge++;
}

bool spfa(int s)
{
    queue<int> q;
    while(!q.empty()) q.pop();
    CLR(vis);
    MST(dis[s],0X3f);
    q.push( shop[s] );
    vis[ shop[s] ] = 1;
    dis[s][ shop[s] ] = 0;
    //printf("dis[%d][%d]=0\n",s,shop[s]);
    //cout<<dis[s][0]<<endl;
    int u,v;
    while(!q.empty())
    {
        u=q.front();
        q.pop();
        for(int i=head[u];~i;i=e[i].next)
        {
            v=e[i].to;
            if(dis[s][v]>dis[s][u]+e[i].w)
            {
                dis[s][v]=dis[s][u]+e[i].w;
                
                if(!vis[v])
                {
                    vis[v]=true;
                    q.push(v);
                }
            }
        }
        vis[u]=0;
    }
    //cout<<dis[s][0]<<endl;
    return true;
}

int dp[12][1<<12];

void DP()
{
    MST(dp,0x3f);
    int nn=(1<<t);
    REP(i,t)
     {
         //cout<<dis[i][0]<<endl;
         dp[i][0]=dis[i][0];
     }
    FOR(i,1,nn-1)
    {
        REP(j,t)
        {
            if(i&(1<<j))
            {
                int res=i^(1<<j);
                REP(k,t)
                {
                    dp[j][i]=min(dp[j][i],dp[k][res]+dis[k][ shop[j] ]);

                }
            }
        }
    }
    int ans=INF;
    REP(i,t)
    {
        ans=min(ans,dp[i][nn-1]+dis[i][0]);
    }
    cout<<ans<<endl;
}

int main()
{
    int cas,a,b,c;
    while(cin>>cas)
    {
        while(cas--)
        {
            cin>>n>>m;
            init();
            REP(i,m)
            {
                cin>>a>>b>>c;
                add(a,b,c);
                add(b,a,c);
            }
            cin>>t;
            REP(i,t)
              cin>>shop[i];
            REP(i,t)
             {
                 spfa(i);
                 //cout<<shop[i]<<endl;
                 //cout<<dis[i][0]<<endl;
             }
           DP();
           //cout<<0x3f<<endl;
        }
    }

    return 0;
}