bzoj 1688: [Usaco2005 Open]Disease Manangement 疾病管理（状压）

2024-04-30 11:48:45

1688: [Usaco2005 Open]Disease Manangement 疾病管理

Time Limit: 5 Sec Memory Limit: 64 MB
Submit: 706 Solved: 456
[Submit][Status][Discuss]

Description

Alas! A set of D (1 <= D <= 15) diseases (numbered 1..D) is running through the farm. Farmer John would like to milk as many of his N (1 <= N <= 1,000) cows as possible. If the milked cows carry more than K (1 <= K <= D) different diseases among them, then the 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 to discard 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 a list of 1 or more space-separated integers. The first integer, d_i, is the count 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 which can be milked.

Sample Input

6 3 2

0---------第一头牛患0种病

1 1------第二头牛患一种病，为第一种病

1 2

1 3

2 2 1

2 2 1

Sample Output

5

题目中文部分少了一句话：答案要尽可能大

因为疾病不超过15种，所以可以暴力每一种疾病组合方式，然后判断只患这些疾病的有多少头牛

复杂度O(2^d+C(d, k)*nd)

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
typedef struct
{int m;int a[17];
}Cow;
Cow s[1005];
int main(void)
{int n, i, j, d, k, p, sum, ans, b[17];scanf("%d%d%d", &n, &d, &k);for(i=1;i<=n;i++){scanf("%d", &s[i].m);for(j=1;j<=s[i].m;j++)scanf("%d", &s[i].a[j]);}ans = 0;for(i=1;i<(1<<d);i++){sum = 0;memset(b, 0, sizeof(b));for(j=0;j<=d-1;j++){if(i&(1<<j))b[j+1] = 1, sum++;}if(sum!=k)continue;sum = 0;for(j=1;j<=n;j++){for(p=1;p<=s[j].m;p++){if(b[s[j].a[p]]==0)break;}if(p==s[j].m+1)sum++;}ans = max(ans, sum);}printf("%d\n", ans);return 0;
}
/*
6 3 2
0
1 1
1 2
1 3
2 2 1
2 2 1
*/

bzoj 1688: [Usaco2005 Open]Disease Manangement 疾病管理（状压）相关推荐

[BZOJ] 1688: [Usaco2005 Open]Disease Manangement 疾病管理
1688: [Usaco2005 Open]Disease Manangement 疾病管理 Time Limit: 5 Sec Memory Limit: 64 MB Submit: 727 S ...
BZOJ 1688: [Usaco2005 Open]Disease Manangement 疾病管理
题目 1688: [Usaco2005 Open]Disease Manangement 疾病管理 Time Limit: 5 Sec Memory Limit: 64 MB Description ...
1688: [Usaco2005 Open]Disease Manangement 疾病管理( 枚举 )
我一开始写了个状压dp..然后没有滚动就MLE了... 其实这道题直接暴力就行了... 2^15枚举每个状态, 然后检查每头牛是否能被选中, 这样是O( 2^15*1000 ), 也是和dp一样的时间 ...
bzoj1688[Usaco2005 Open]Disease Manangement 疾病管理*
bzoj1688[Usaco2005 Open]Disease Manangement 疾病管理题意: n头牛,d种疾病,每头牛都患一些疾病,现在要求选出最多的牛,使这些牛患病的种类数不超过k.n≤ ...
[Usaco2005 Open]Disease Manangement 疾病管理 BZOJ1688
分析: 这个题的状压DP还是比较裸的,考虑将疾病状压,得到DP方程:F[S]为疾病状态为S时的最多奶牛数量,F[S]=max{f[s]+1}; 记得预处理出每个状态下疾病数是多少... 附上代码: # ...
[BZOJ 1879][SDOI 2009]Bill的挑战题解(状压DP)
[BZOJ 1879][SDOI 2009]Bill的挑战 Description Solution 1.考虑状压的方式. 方案1:如果我们把每一个字符串压起来,用一个布尔数组表示与每一个字母的匹配关 ...
【BZOJ 4565】 [Haoi2016]字符合并区间dp+状压
考试的时候由于总是搞这道题导致爆零~~~~~(神™倒序难度.....) 考试的时候想着想着想用状压,但是觉得不行又想用区间dp,然而正解是状压着搞区间,这充分说明了一件事,状压不是只是一种dp而是一种 ...
【BZOJ】1076 [SCOI2008]奖励关期望DP+状压DP
[题意]n种宝物,k关游戏,每关游戏给出一种宝物,可捡可不捡.每种宝物有一个价值(有负数).每个宝物有前提宝物列表,必须在前面的关卡取得列表宝物才能捡起这个宝物,求期望收益.k<=100,n&l ...
【BZOJ 2595】2595: [Wc2008]游览计划（状压DP+spfa，斯坦纳树？）
2595: [Wc2008]游览计划 Time Limit: 10 Sec Memory Limit: 256 MBSec Special Judge Submit: 1572 Solved: ...

最新文章

热门文章