hdu 3006 The Number of set

最新推荐文章于 2022-02-03 21:36:08 发布

brucehb

最新推荐文章于 2022-02-03 21:36:08 发布

阅读量139

点赞数

分类专栏：状态压缩dp 文章标签：算法

本文链接：https://blog.csdn.net/brucehb/article/details/88770659

版权

状态压缩dp 专栏收录该内容

8 篇文章 0 订阅

订阅专栏

Problem Description

Given you n sets.All positive integers in sets are not less than 1 and not greater than m.If use these sets to combinate the new set,how many different new set you can get.The given sets can not be broken.

Input

There are several cases.For each case,the first line contains two positive integer n and m(1<=n<=100,1<=m<=14).Then the following n lines describe the n sets.These lines each contains k+1 positive integer,the first which is k,then k integers are given. The input is end by EOF.

Output

For each case,the output contain only one integer,the number of the different sets you get.

Sample Input

4 4

1 1

1 2

1 3

1 4

2 4

3 1 2 3

4 1 2 3 4

Sample Output

思路：

用二进制的每一位来表示一个数，比如最低位为1表示1，倒数第二位为1表示2。

对各个集合进行或运算即可完成相加去重的过程。

#include <cstring>
#include <iostream>
#include <cstdlib>
using namespace std;

bool vis[1<<15];
int main()
{
    int n, m;
    while (scanf("%d%d", &n, &m) != EOF)
    {
        memset(vis, false, sizeof(vis));
        for(int i = 1; i <= n; i++)
        {
            int k, a, res = 0;
            scanf("%d", &k);
            while (k--)
            {
                scanf("%d", &a);
                res |= 1 << (a-1);
            }
            vis[res] = true;
            for(int j = 0; j < (1<<m); j++)
            {
                if (vis[j])
                {
                	vis[j|res] = true;
                }
            }
        }
        int result = 0;
        for (int i = 0; i < (1<<m); i++)
        {
        	if (vis[i])
        	{
        		result++;
        	}
        }
        printf("%d\n", result);
    }
    
    return 0;
}