POJ 2441 Arrange the Bulls(状压+01背包->求方法数)

Arrange the Bulls
Time Limit:4000MS     Memory Limit:65536KB     64bit IO Format:%lld & %llu

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


这题要处理牛和牛棚两层关系,用状压情况有些复杂;在求方法数的时候先令方法为0,从第一头牛开始遍历找可满足的情况,然后更新后面状态,但是要消除用过的方法,因为如果有两个牛都只能在当前棚显然是满足不了的,只有分开放置,,,背包从大往小遍历;技巧性强



#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
const int N = 20;
int  a[N][N], v[N];
int dp[(1<<N)+11];


int main()
{
    int n, m;
    while(scanf("%d %d", &n, &m)!=EOF)
    {
        memset(a,0,sizeof(a));
        for(int i=0;i<n;i++)
        {
            int k, x;
            scanf("%d", &k);
            while(k--)
            {
                scanf("%d", &x);
                x--;
                a[i][x]=1;
            }
        }
        memset(dp,0,sizeof(dp));
        if(n>m)
        {
            printf("0\n");
            continue;
        }
        dp[0]=1;
        for(int i=0;i<n;i++)
        {
            for(int j=(1<<m)-1;j>=0;j--)
            {
                if(dp[j]==0)
                    continue;
                for(int k=0;k<m;k++)
                {
                    if((j&(1<<k))||a[i][k]==0)
                        continue;
                    int state=(j|(1<<k));
                    dp[state]+=dp[j];
                }
                dp[j]=0;
            }
        }
        int ans=0;
        for(int i=0;i<(1<<m);i++)
            ans+=dp[i];
        printf("%d\n",ans);
    }
    return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值