POJ 2441 Arrange the Bulls

题目链接：http://poj.org/problem?id=2441

题意：有n个奶牛，m个牛棚（编号1~m），每只奶牛都会有自己喜欢的牛棚的编号，问有多少种方法可以将它们全部安排进牛棚且每个牛棚只有一只奶牛。

思路：状态压缩DP，因为牛棚每个只能用一次，所以把每个牛棚是否用过作为状态压缩，然后从第一个牛开始枚举到第n个。再枚举下一个牛用哪个牛棚，就可以转移了。

#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <sstream>
#include <queue>
#include <utility>
using namespace std;

#define rep(i,j,k) for (int i=j;i<=k;i++)
#define Rrep(i,j,k) for (int i=j;i>=k;i--)

#define Clean(x,y) memset(x,y,sizeof(x))
#define LL long long
#define ULL unsigned long long
#define inf 0x7fffffff
#define mod %100000007

int n,m;
vector<int> can[25];

int dp[2][1<<20];
int Pow[21];

int main()
{
    scanf("%d%d",&n,&m);
    Pow[0] = 1;
    rep(i,1,20) Pow[i] = Pow[i-1]<<1;

    rep(i,1,n)
    {
        int temp,num;
        scanf("%d",&num);
        can[i].clear();
        rep(j,1,num)
        {
            scanf("%d",&temp);
            can[i].push_back(temp);
        }
    }
    Clean(dp,0);
    if ( m < n )
    {
        puts("0");
        return 0;
    }
    int uplim = 1<<m;
    dp[0][0] = 1;
    int p = 1;
    int q = 0;

    rep(i,1,n)
    {
        rep(s,0,uplim-1) //last state
        {
            if ( dp[q][s] == 0 ) continue;
            rep( j,0,can[i].size()-1 )
                if ( !(s & Pow[ can[i][j] -1 ]) )
                {
                    int next = s | Pow[ can[i][j] -1 ];
                    dp[p][next] += dp[q][s];
                }
            //Clean(dp[q],0);
        }
        Clean(dp[q],0);
        p = 1 - p;
        q = 1 - q;

    }
    int ans = 0;
    rep(i,1,uplim-1) ans+=dp[q][i];
    printf("%d\n",ans);
    return 0;
}