Disease Management

最新推荐文章于 2020-12-02 19:13:29 发布

rucefan

最新推荐文章于 2020-12-02 19:13:29 发布

阅读量447

点赞数

CC 4.0 BY-SA版权

分类专栏： ACM 文章标签： integer list output

本文链接：https://blog.csdn.net/Shimizu_Masato/article/details/6559565

ACM 专栏收录该内容

55 篇文章

订阅专栏

本文探讨了在特定疾病控制下，农民约翰如何最大化挤奶奶牛数量，确保牛奶品质不受污染，通过算法解决实际问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

时限：1000ms 内存限制：10000K 总时限：3000ms

描述：

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.

输入：

* 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.

输出：

* Line 1: M, the maximum number of cows which can be milked.

输入样例：

6 3 2
0
1 1
1 2
1 3
2 2 1
2 2 1

输出样例：

提示：

OUTPUT DETAILS:

If FJ milks cows 1, 2, 3, 5, and 6, then the milk will have only two diseases (#1 and #2), which is no greater than K (2).

#include <iostream> using namespace std; int n, d, k, max_cow = 0; int cows[1000], diseases[15]; void FindDiseases(int kind, int have, int uni_dis) { if (d - kind < k - have) return; if (have == k) { int count = 0; for (int i = 0; i < n; ++i) { if (cows[i] == (cows[i] & uni_dis)) ++count; } if (count > max_cow) max_cow = count; } else { FindDiseases(kind + 1, have, uni_dis); FindDiseases(kind + 1, have + 1, (uni_dis | diseases[kind])); } } int main(void) { int i, j, kinds, dis; for (i = 0; i < 15; ++i) diseases[i] = (1 << i); cin >> n >> d >> k; for (i = 0; i < n; ++i) { cin >> kinds; for (j = 0; j < kinds; ++j) { cin >> dis; cows[i] |= diseases[dis - 1]; } } FindDiseases(0, 0, 0); cout << max_cow << endl; return 0; }