hdu3006——The Number of set
来源:互联网 发布:输入法 mac 编辑:程序博客网 时间:2024/05/22 03:15
The Number of set
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1160 Accepted Submission(s): 709
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 41 11 21 31 42 43 1 2 34 1 2 3 4
Sample Output
152
Source
2009 Multi-University Training Contest 11 - Host by HRBEU
Recommend
gaojie | We have carefully selected several similar problems for you: 3007 3003 3004 3002 3005
同学让我看的这道题,刚看还以为是dp,后来仔细看了结果发现自己想不出如何简洁地表示状态,然后换了思路
我们可以发现,m <=14,这个条件给我很大的启发,为什么我不把一个集合看成一个整数A呢?集合里出现某个数我就在A的对应位上置1,然后,合并集合的操作就是或运算了,这时候只要加上标记然后dfs就可以得到答案了,数据比较小
同学让我看的这道题,刚看还以为是dp,后来仔细看了结果发现自己想不出如何简洁地表示状态,然后换了思路
我们可以发现,m <=14,这个条件给我很大的启发,为什么我不把一个集合看成一个整数A呢?集合里出现某个数我就在A的对应位上置1,然后,合并集合的操作就是或运算了,这时候只要加上标记然后dfs就可以得到答案了,数据比较小
#include <map>#include <set>#include <list>#include <queue>#include <stack>#include <vector>#include <cmath>#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>using namespace std;int jihe[2222];bool vis[33333];int ans, n;void dfs(int x, int v){for (int i = 1; i <= n; ++i){if (vis[v | jihe[i]] || i == x){continue;}vis[v | jihe[i]] = 1;ans++;dfs(i, v | jihe[i]);}}int main(){int m, k, pos;while (~scanf("%d%d", &n, &m)){memset (vis, 0, sizeof(vis));memset (jihe, 0, sizeof(jihe));ans = 0;for (int i = 1; i <= n; ++i){scanf("%d", &k);for (int j = 0; j < k; ++j){scanf("%d", &pos);jihe[i] |= (1 << pos);}if (vis[jihe[i]]){continue;}vis[jihe[i]] = 1;ans++;}for (int i = 1; i <= n; ++i){dfs(i, jihe[i]);}printf("%d\n", ans);}return 0;}
0 0
- hdu3006——The Number of set
- HDU3006-The Number of se
- HDU The Number of set
- 3006 The Number of set
- hdu 3006 the number of set 【dp】
- hdu 3006 The Number of set
- hdu 3006 The Number of set
- HDU 3006 The Number of set
- HDU-3006The Number of set
- HDU,3006,The Number of set
- [置顶]The Number of set-hdu-3006
- HDU 3006 The Number of set
- The Number of set(状态压缩)
- The number of ponds——DFS
- sdut2623——The number of steps
- hdoj 3006 The Number of set(位运算+枚举)
- HDU 3006 The Number of set (搜索+位压缩)
- HDU OJ 3306 The Number of set【状态压缩】
- STL 之 string
- Java并发编程目录
- SIFT算法详解
- kaldi上使用gpu以及如何安装cuda
- 单例模式的七种写法
- hdu3006——The Number of set
- 第12周项目2 多种输入形式的处理(2、分离正整数中的各位数)
- 游戏开始前,设置的延迟
- 比微软kinect更强的视频跟踪算法--TLD跟踪算法介绍
- Android SDK Android NDK Android Studio 官方下载地址
- JavaScript语言基础9
- StringTokenizer类的使用
- onInterceptTouchEvent 和 onTouchEvent
- 沪港通,开了!