计蒜客 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 M. Frequent Subsets Problem (位压缩)
来源:互联网 发布:绿岸网络2017 编辑:程序博客网 时间:2024/06/05 23:46
The frequent subset problem is defined as follows. Suppose UUU={1, 2,…\ldots…,N} is the universe, and S1S_{1}S1,S2S_{2}S2,…\ldots…,SMS_{M}SM are MMM sets over UUU. Given a positive constant α\alphaα,0<α≤10<\alpha \leq 10<α≤1, a subset BBB (B≠0B \neq 0B≠0) is α-frequent if it is contained in at least αM\alpha MαM sets of S1S_{1}S1,S2S_{2}S2,…\ldots…,SMS_{M}SM, i.e. ∣{i:B⊆Si}∣≥αM\left | \left \{ i:B\subseteq S_{i} \right \} \right | \geq \alpha M∣{i:B⊆Si}∣≥αM. The frequent subset problem is to find all the subsets that are α-frequent. For example, letU={1,2,3,4,5}U=\{1, 2,3,4,5\}U={1,2,3,4,5},M=3M=3M=3,α=0.5\alpha =0.5α=0.5, and S1={1,5}S_{1}=\{1, 5\}S1={1,5},S2={1,2,5}S_{2}=\{1,2,5\}S2={1,2,5},S3={1,3,4}S_{3}=\{1,3,4\}S3={1,3,4}. Then there are 333 α-frequent subsets of UUU, which are {1}\{1\}{1},{5}\{5\}{5} and {1,5}\{1,5\}{1,5}.
Input Format
The first line contains two numbers NNN and α\alpha α, where NNN is a positive integers, and α\alphaα is a floating-point number between 0 and 1. Each of the subsequent lines contains a set which consists of a sequence of positive integers separated by blanks, i.e., linei+1i + 1i+1 contains SiS_{i}Si,1≤i≤M1 \le i \le M1≤i≤M . Your program should be able to handle NNN up to 202020 and MMM up to 505050.
Output Format
The number of α\alphaα-frequent subsets.
样例输入
15 0.41 8 14 4 13 23 7 11 610 8 4 29 3 12 7 15 28 3 2 4 5
样例输出
11
题目来源
2017 ACM-ICPC 亚洲区(南宁赛区)网络赛
#include<cstdio>#include<cstring>#include<cmath>#include<set>#include<vector>using namespace std;const int N = 30;const int M = 60;int mm[M];int n;int ans;int Ma;int main(){double a;scanf("%d%lf",&n,&a);getchar();int line=0;char str[1000];while(gets(str)!=NULL){line++;int temp=0;for(int i=0;str[i]!='\0';i++){if(str[i]==' '||str[i]=='\0'){mm[line]=mm[line]|(1<<(temp-1));temp=0;}else{temp=temp*10+str[i]-'0';}}if(temp) {mm[line]=mm[line]|(1<<(temp-1));}//if(line==5) break;}Ma=(int)((a*line)+0.999999999);ans=0;for(int i=1;i<(1<<n);i++){int fi=0;for(int j=1;j<=line;j++){if((i&mm[j])==i) fi++;if(fi>=Ma) break;}if(fi>=Ma) ans++;} printf("%d\n",ans); return 0;}
- 计蒜客 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 M. Frequent Subsets Problem (位压缩)
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛: M. Frequent Subsets Problem(状压)
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 M. Frequent Subsets Problem
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 M Frequent Subsets Problem
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 M. Frequent Subsets Problem (状态压缩)
- 2017 ACM-ICPC亚洲区(南宁赛区)网络赛 F.Frequent Subsets Problem
- Frequent Subsets Problem 进制运算 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 Frequent Subsets Problem
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛:Frequent Subsets Problem
- 2017ICPC 南宁网络赛M Frequent Subsets Problem
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 M题
- 2017南宁网络赛M.Frequent Subsets Problem (状态压缩)
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 The Heaviest Non-decreasing Subsequence Problem
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 The Heaviest Non-decreasing Subsequence Problem
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 The Heaviest Non-decreasing Subsequence Problem
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛:The Heaviest Non-decreasing Subsequence Problem
- CTS 环境搭建及注意事项
- 图论——最小生成树
- bzoj 5043: 密码破译
- Prime Ring Problem
- smoj2017(树链剖分+线段树/LCT)
- 计蒜客 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 M. Frequent Subsets Problem (位压缩)
- memset的一个错误用法
- Kaggle学习之Machine Learning from Disaster(1)
- git
- c++ 虚函数
- 每天一篇Makefile(一)
- 安装WIN10 准备就绪半小时
- 每日掌握一个Linux命令 之 检测系统资源化 vmstat
- 第三周第一节课(第二章--线性表)