zoukankan      html  css  js  c++  java
  • BZOJ 1688: [Usaco2005 Open]Disease Manangement 疾病管理

    题目

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

    Time Limit: 5 Sec  Memory Limit: 64 MB

    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

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

    HINT

     

    Source

    题解

    Orz我们用强大的Bitset暴力>_< 大力出奇迹!

    代码

     1 /*Author:WNJXYK*/
     2 #include<cstdio>
     3 #include<bitset> 
     4 using namespace std;
     5 const int Maxn=1000;
     6 int n,d,k;
     7 bitset<16> dis[Maxn+5];
     8 int Ans=0;
     9 int main(){
    10     scanf("%d%d%d",&n,&d,&k);
    11     for (int i=1;i<=n;i++){
    12         int tmp;
    13         scanf("%d",&tmp);
    14         dis[i].reset();
    15         for (int j=1;j<=tmp;j++){
    16             int temp;
    17             scanf("%d",&temp);
    18             dis[i].set(temp-1);
    19         }
    20     }
    21     for (int i=1;i<=(1<<d);i++){
    22         int tmpAns=0;
    23         bitset<16> tmp((long)i);
    24         if (tmp.count()>k) continue;
    25         for (int j=1;j<=n;j++) if ((tmp|dis[j])==tmp) tmpAns++; 
    26         Ans=(Ans<tmpAns?tmpAns:Ans);
    27     } 
    28     printf("%d
    ",Ans);
    29     return 0;
    30 }
    View Code
  • 相关阅读:
    远景GIS云产品规划
    远景GIS云上线
    远景WEBGIS平台实现客户端SHP文件加载
    GIS平台结构设计
    一款基于HTML5的高性能WEBGIS介绍
    Git分布式工作流程
    Git服务器搭建
    Linux入门-9 软件管理基础(CentOS)
    Linux入门-8 Linux系统启动详解
    Linux入门-7 Linux管道、重定向以及文本处理
  • 原文地址:https://www.cnblogs.com/WNJXYK/p/4098041.html
Copyright © 2011-2022 走看看