BZOJ1688 [Usaco2005 Open]DiseaseManangement 疾病管理
来源:互联网 发布:遇到网络诈骗400怎么办 编辑:程序博客网 时间:2024/06/04 23:30
标签:状压DP
Description
Alas! A set of D (1 <= D <= 15)diseases (numbered 1..D) is running through the farm. Farmer John would like tomilk as many of his N (1 <= N <= 1,000) cows as possible. If the milkedcows carry more than K (1 <= K <= D) different diseases among them, thenthe milk will be too contaminated and will have to be discarded in its entirety.Please help determine the largest number of cows FJ can milk without having todiscard the milk.
Input
* Line 1: Three space-separated integers:N, D, and K * Lines 2..N+1: Line i+1 describes the diseases of cow i with alist of 1 or more space-separated integers. The first integer, d_i, is thecount of cow i's diseases; the next d_i integers enumerate the actual diseases.Of course, the list is empty if d_i is 0. 有N头牛,它们可能患有D种病,现在从这些牛中选出若干头来,但选出来的牛患病的集合中不过超过K种病.
Output
* Line 1: M, the maximum number of cows whichcan be milked.
Sample Input
6 3 2
0---------第一头牛患0种病
1 1------第二头牛患一种病,为第一种病.
1 2
1 3
2 2 1
2 2 1
Sample Output
5
OUTPUT DETAILS:
If FJ milks cows 1, 2, 3, 5, and 6, thenthe milk will have only two
diseases (#1 and #2), which is no greaterthan K (2).
无脑状压,以d种病作为状态,最后寻找小于K的最优ans值即可
Code
#include<iostream>#include<iomanip>#include<cstring>#include<cstdio>#include<cstdlib>#include<algorithm>#define rep(i,a,b) for(int i=a;i<=b;i++)#define dep(i,a,b) for(int i=a;i>=b;i--)#define LL long long#define mem(x,num) memset(x,num,sizeof x)using namespace std;inline LL read(){ LL f=1,x=0;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}return x*f;}const int maxn=20;LL bin[20],a[1006],f[1<<maxn];LL n,d,k,ed,ans;inline bool jud(int x){int tot=0;rep(i,1,d)if(bin[i-1]&x){tot++;if(tot>k)return 0;}return 1;}int main(){bin[0]=1;rep(i,1,maxn)bin[i]=bin[i-1]<<1;n=read(),d=read(),k=read();ed=(1<<d)-1;rep(i,1,n){LL x=read();rep(j,1,x){LL y=read();a[i]+=bin[y-1];}}//a[i]记录状态 rep(i,1,n)dep(j,ed,0)f[j|a[i]]=max(f[j|a[i]],f[j]+1);//注意倒序转移rep(i,0,ed)if(jud(i))ans=max(ans,f[i]);//在d种病的状态中更新最佳答案printf("%lld\n",ans);return 0;}
- BZOJ1688 [Usaco2005 Open]DiseaseManangement 疾病管理
- bzoj1688 [Usaco2005 Open]Disease Manangement 疾病管理
- [BZOJ1688] [Usaco2005 Open]Disease Manangement 疾病管理
- BZOJ1688: [Usaco2005 Open]Disease Manangement 疾病管理
- bzoj1688 [Usaco2005 Open]Disease Manangement 疾病管理
- 【bzoj1688】[Usaco2005 Open]Disease Manangement 疾病管理
- bzoj1688: [Usaco2005 Open]Disease Manangement 疾病管理(状压dp)
- [BZOJ1688][Usaco2005 Open]Disease Manangement 疾病管理(状压dp)
- bzoj1688: [Usaco2005 Open]Disease Manangement 疾病管理 状压dp
- [BZOJ1688][Usaco2005 Open]Disease Manangement 疾病管理(状压dp)
- BZOJ1688 疾病管理
- 1688: [Usaco2005 Open]Disease Manangement 疾病管理
- 1688: [Usaco2005 Open]Disease Manangement 疾病管理
- [Usaco2005 Open]Disease Manangement 疾病管理
- BZOJ 1688: [Usaco2005 Open]Disease Manangement 疾病管理
- bzoj 1688 [Usaco2005 Open]Disease Manangement 疾病管理
- bzoj 1688: [Usaco2005 Open]Disease Manangement 疾病管理 dfs
- bzoj 1688: [Usaco2005 Open]Disease Manangement 疾病管理(状压)
- 动态规划-最长回文子序列
- CentOS6.5下修改mysql密码以及解决MySQL ERROR 1045 (28000):
- 【Linux】fork,vfork 与exec作用详解
- springtest整合junit并结合logback打印mybatis执行详细信息
- error LNK2019: unresolved external symbol "__declspec(dllimport) const CReadUserInfo::`vftable'" (__
- BZOJ1688 [Usaco2005 Open]DiseaseManangement 疾病管理
- lamp配置域名
- script标签
- 【bzoj4443】【[Scoi2015]小凸玩矩阵】二分+二分图最大匹配
- ViewPager无限轮播
- @ManagedBean源码翻译
- C#编程入门15_简单算法
- Android热更新技术的研究与实现(三)
- asm.jar包冲突