codeforces 418B. Cunning Gena (状态dp)

http://codeforces.com/problemset/problem/418/B

题目：

A boy named Gena really wants to get to the "Russian Code Cup" finals, or at least get a t-shirt. But the offered problems are too complex, so he made an arrangement with his n friends that they will solve the problems for him.

The participants are offered m problems on the contest. For each friend, Gena knows what problems he can solve. But Gena's friends won't agree to help Gena for nothing: the i-th friend asks Gena x_i rubles for his help in solving all the problems he can. Also, the friend agreed to write a code for Gena only if Gena's computer is connected to at least k_i monitors, each monitor costs b rubles.

Gena is careful with money, so he wants to spend as little money as possible to solve all the problems. Help Gena, tell him how to spend the smallest possible amount of money. Initially, there's no monitors connected to Gena's computer.

Input

The first line contains three integers n, m and b (1 ≤ n ≤ 100; 1 ≤ m ≤ 20; 1 ≤ b ≤ 10⁹) — the number of Gena's friends, the number of problems and the cost of a single monitor.

The following 2n lines describe the friends. Lines number 2i and (2i + 1) contain the information about the i-th friend. The 2i-th line contains three integers x_i, k_i and m_i (1 ≤ x_i ≤ 10⁹; 1 ≤ k_i ≤ 10⁹; 1 ≤ m_i ≤ m) — the desired amount of money, monitors and the number of problems the friend can solve. The (2i + 1)-th line contains m_i distinct positive integers — the numbers of problems that the i-th friend can solve. The problems are numbered from 1 to m.

Output

Print the minimum amount of money Gena needs to spend to solve all the problems. Or print -1, if this cannot be achieved.

Sample test(s)

Input

2 2 1
100 1 1
2
100 2 1
1

Output

202

Input

3 2 5
100 1 1
1
100 1 1
2
200 1 2
1 2

Output

205

Input

1 2 1
1 1 1
1

Output

-1

分析：

 
 

  
  monitor 是公有因素
 
 
 
 

  
  X 是个人的私有因素
 
 
 
 

  
  b 是和monitor相关的共有因素
 
 
 
 

  
  这些烦人的公有因素刚好可以作为建立dp的基础。
 
 
 
 

  
  先按照monitor的多少从小到大排序，然后解决的问题情况作为dp的下标可以‘或’转移，k*b作为另一个因素在dp完成后再加在answer上，不断最小
化更新（哇哦哇哦，这就是传说中的状态dp）
 
 

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
usingnamespace std;
typedef long long LL;
const LL INF=1LL<<60;// 1LL << 60
struct node
{
   int x,k,prob;
}f[110];
LL dp[(1<<20)+10];
int cmp(node a,node b){
   return a.k<b.k;
}
int main()
{
   //freopen("cin.txt","r",stdin);
   int n,m,b;
   while(~scanf("%d%d%d",&n,&m,&b))
   { 
       memset(dp,-1,sizeof(dp));
       memset(f,0,sizeof(f));
       for(int i=0;i<n;i++){
          int ls,key;
          scanf("%d%d%d",&f[i].x,&f[i].k,&ls);
          for(int j=0;j<ls;j++){
              scanf("%d",&key);
              f[i].prob|=(1<<(key-1));
          }
       }
       sort(f,f+n,cmp);
       dp[0]=0;
       LL  ans=INF;
       for(int i=0;i<n;i++){//对应下标 
           for(int j=0;j<(1<<m);j++){
               if(dp[j]==-1)continue;// 注意覆盖
               int temp=j|f[i].prob;
               if(dp[temp]==-1) dp[temp]=dp[j]+f[i].x;
               else dp[temp]=min(dp[temp],dp[j]+f[i].x);
           }
           if(dp[(1<<m)-1]!=-1){
               ans=min(ans,dp[(1<<m)-1]+1LL*f[i].k*b);
           }
       }
       if(ans==INF)  ans=-1;
       printf("%lld\n",ans);
   }
   return0;
}