The Number of set(状态压缩)

2017年02月26日 10点热度 0人点赞 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

15
2
 

#include
#include
#include
using namespace std;
int main(){
	int set[1<<14],n,m,nn,t,w;
	while(~scanf("%d%d",&n,&m)){
		memset(set,0,sizeof(set));
		while(n--){
			scanf("%d",&nn);
		w=0;
		while(nn--){
			scanf("%d",&t);
			w+=1<<(t-1);
		}
		set[w]=1;
		for(int i=1;i<1<<14;i++)
		if(set[i])
		set[i|w]=1;
		}
		w=0;
		for(int i=1;i<1<<14;i++)
		if(set[i])
		w++;
		printf("%dn",w);
	}
	return 0;
}
未经允许不得转载!The Number of set(状态压缩)

update

纸上得来终觉浅, 绝知此事须躬行。