hdu 4114 状压dp floyd

dp[s1][s2][i] s1为当前必达景点状态 s2为当前拥有钥匙状态 i为当前到达节点

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=55;
const int inf=1<<29;
int n,m,K,u,v,w,i,j,k,s1,s2,dp[1<<8][1<<8][N],p[N],t[N],ft[N],g[N][N],f[N],MAX,ans,T,ni,a,kase;
void init()
{
    for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)g[i][j]=(i==j?0:inf);
    memset(f,0,sizeof(f));
    MAX=1<<K;ans=inf;
    for(int i=0;i<MAX;i++)for(int j=0;j<MAX;j++)for(int k=1;k<=n;k++)dp[i][j][k]=inf;
    dp[0][0][1]=0;
}
int main()
{//freopen("C:\\Users\\Administrator\\Desktop\\input.txt","r",stdin);
    scanf("%d",&T);
    while(T--){
        scanf("%d%d%d",&n,&m,&K);
        init();
        while(m--){
            scanf("%d%d%d",&u,&v,&w);
            g[u][v]=g[v][u]=min(g[u][v],w);
        }
        for(k=1;k<=n;k++) for(i=1;i<=n;i++) for(j=1;j<=n;j++) g[i][j]=min(g[i][j],g[i][k]+g[k][j]);//预处理最短路
        for(i=0;i<K;i++){
            scanf("%d%d%d%d",&p[i],&t[i],&ft[i],&ni);
            while(ni--){
                scanf("%d",&a);
                f[a]|=(1<<i);//每个节点拥有的钥匙
            }
        }
        for(s1=0;s1<MAX;s1++)//景点游览状态
            for(s2=0;s2<MAX;s2++)//钥匙拥有状态
                for(i=1;i<=n;i++)//枚举旅游景点
                    if(dp[s1][s2][i]!=inf){//如果该状态可到达
                        if(s1==MAX-1) ans=min(ans,dp[s1][s2][i]+g[i][1]);//更新答案
                        for(j=0;j<K;j++)//枚举必达景点
                            if((s1&(1<<j))==0){//如果没到达过该节点
                                if(s2&(1<<j)) dp[s1^(1<<j)][s2|f[p[j]]][p[j]]=min(dp[s1^(1<<j)][s2|f[p[j]]][p[j]],dp[s1][s2][i]+g[i][p[j]]+ft[j]);//有钥匙
                                else dp[s1^(1<<j)][s2|f[p[j]]][p[j]]=min(dp[s1^(1<<j)][s2|f[p[j]]][p[j]],dp[s1][s2][i]+g[i][p[j]]+t[j]);//没钥匙
                            }
                        for(j=1;j<=n;j++)//更新钥匙状态
                            dp[s1][s2|f[j]][j]=min(dp[s1][s2][i]+g[i][j],dp[s1][s2|f[j]][j]);
                    }
        printf("Case #%d: %d\n",++kase,ans);
    }
    return 0;
}