codeforce 417D Cunning Gena （状压DP）

#include<bits/stdc++.h>

#define clr(x,y) memset((x),(y),sizeof(x))

using namespace std;
typedef long long LL;

const int maxn=(1<<20);
const LL inf=2e18;

struct Node
{
    LL x,k,m;
    int S;

    bool operator < (const Node& a) const
    {
        return k<a.k;
    }
};

LL dp[maxn+5][2];
Node f[105];

LL n,m,b;

int main(void)
{
    #ifdef ex
    freopen ("../in.txt","r",stdin);
    //freopen ("../out.txt","w",stdout);
    #endif

    scanf("%I64d%I64d%I64d",&n,&m,&b);
    for (int i=1;i<=n;++i)
    {
        scanf("%I64d%I64d%I64d",&f[i].x,&f[i].k,&f[i].m);
        int q;
        for (int j=1;j<=f[i].m;++j)
        {
            scanf("%d",&q);
            --q;
            f[i].S=f[i].S|(1<<q);
        }
    }

    sort(f+1,f+1+n);

    int S=(1<<m)-1;
    dp[0][0]=0;
    dp[0][1]=0;
    for (int i=1;i<=S;++i)
        for (int j=0;j<=1;++j)
            dp[i][j]=inf;

    for (int i=1;i<=n;++i)
    {
        //printf("%d\n",f[i].S);
        for (int j=S;j>=0;--j)
        {
            if (dp[j][0]==inf) continue;
            int tS=j|f[i].S;
            dp[tS][0]=min(dp[tS][0],dp[j][0]+f[i].x);
            dp[tS][1]=min(dp[tS][1],dp[j][0]+f[i].x+f[i].k*b);

            //printf("%d %d %d\n",tS,i,dp[tS][1]);
        }
    }

    if (dp[S][1]==inf) printf("-1\n");
    else printf("%I64d\n",dp[S][1]);
}