POJ 2441 状压DP

Arrange the Bulls

Time Limit: 4000MS		Memory Limit: 65536K
Total Submissions: 5289		Accepted: 2033

Description

Farmer Johnson's Bulls love playing basketball very much. But none of them would like to play basketball with the other bulls because they believe that the others are all very weak. Farmer Johnson has N cows (we number the cows from 1 to N) and M barns (we number the barns from 1 to M), which is his bulls' basketball fields. However, his bulls are all very captious, they only like to play in some specific barns, and don’t want to share a barn with the others.

So it is difficult for Farmer Johnson to arrange his bulls, he wants you to help him. Of course, find one solution is easy, but your task is to find how many solutions there are.

You should know that a solution is a situation that every bull can play basketball in a barn he likes and no two bulls share a barn.

To make the problem a little easy, it is assumed that the number of solutions will not exceed 10000000.

Input

In the first line of input contains two integers N and M (1 <= N <= 20, 1 <= M <= 20). Then come N lines. The i-th line first contains an integer P (1 <= P <= M) referring to the number of barns cow i likes to play in. Then follow P integers, which give the number of there P barns.

Output

Print a single integer in a line, which is the number of solutions.

Sample Input

3 4
2 1 4
2 1 3
2 2 4

Sample Output

4

Source

POJ Monthly,TN

题意：每只牛只想在特定的房间里玩，每个房间只能有一只牛，问你能够满足以上条件的情况有几种。

代码：

 //#include "bits/stdc++.h"
 #include "cstdio"
 #include "map"
 #include "set"
 #include "cmath"
 #include "queue"
 #include "vector"
 #include "string"
 #include "cstring"
 #include "time.h"
 #include "iostream"
 #include "stdlib.h"
 #include "algorithm"
 #define db double
 #define ll long long
 //#define vec vector<ll>
 #define Mt  vector<vec>
 #define ci(x) scanf("%d",&x)
 #define cd(x) scanf("%lf",&x)
 #define cl(x) scanf("%lld",&x)
 #define pi(x) printf("%d\n",x)
 #define pd(x) printf("%f\n",x)
 #define pl(x) printf("%lld\n",x)
 #define inf 0x3f3f3f3f
 #define rep(i, x, y) for(int i=x;i<=y;i++)
 const int N   = 1e5 + ;
 const int mod = 1e9 + ;
 const int MOD = mod - ;
 const db  eps = 1e-;
 const db  PI  = acos(-1.0);
 using namespace std;
 int f[<<],a[][];
 int n,m;
 int main()
 {
     while(scanf("%d%d",&n,&m)==)
     {
         int x;
         memset(a,, sizeof(a));
         memset(f,, sizeof(f));
         for(int i=;i<n;i++){
             ci(x);
             for(int j=;j<x;j++){
                 int y;
                 ci(y);
                 a[i][y-]=;
             }
         }
         if(n>m) {
             puts("");
             continue;
         }
         f[]=;
         for(int i=;i<n;i++){//枚举n只牛
             for(int j=(<<m)-;j>=;j--){//枚举每一个集合
                 if(f[j])//如果集合存在
                 {
                     for(int k=;k<m;k++){//枚举每个房间
                         if((j&(<<k))!=||!a[i][k]) continue;//集合已用此房间或牛不喜欢此房间
                         int S=(<<k)|j;//牛进入房间得到新的集合
                         f[S]+=f[j];
                     }
                 }
                 f[j]=;//枚举的集合变为新集合，旧集合需要消除
             }
         }
         ll ans=;
         for(int i=;i<(<<m);i++) ans+=f[i];//留下满足条件的
         pl(ans);
     }
     return ;
 }