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

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

    Time Limit: 5 Sec  Memory Limit: 64 MB
    Submit: 413  Solved: 275
    [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

    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

    Silver

    题解:其实一开始想的很复杂,连树状数组都想过用上,但是后来发现貌似也就15种病,这样子就容易了——直接进行01状态压缩,然后枚举各种状态(HansBug:实际上,对于疾病的状态只需要保留刚刚好K种病即可,就算是更少的病种也可以剪掉,想想为什么^_^),然后就是各种位运算,然后A掉么么哒

     1 /**************************************************************
     2     Problem: 1688
     3     User: HansBug
     4     Language: Pascal
     5     Result: Accepted
     6     Time:80 ms
     7     Memory:4132 kb
     8 ****************************************************************/
     9  
    10 var
    11    i,j,k,l,m,n,x,ans:longint;
    12    a:array[0..1000000] of longint;
    13 function min(x,y:longint):longint;
    14          begin
    15               if x<y then min:=x else min:=y;
    16          end;
    17 function max(x,y:longint):longint;
    18          begin
    19               if x>y then max:=x else max:=y;
    20          end;
    21 begin
    22      readln(n,m,l);l:=min(l,m);ans:=0;
    23      for i:=1 to n do
    24          begin
    25               a[i]:=0;
    26               read(k);
    27               for j:=1 to k do
    28                   begin
    29                        read(x);
    30                        a[i]:=a[i] or (1 shl (x-1));
    31                   end;
    32               readln;
    33          end;
    34      for i:=0 to trunc(exp(ln(2)*m)-1) do
    35          begin
    36               j:=i;k:=0;
    37               while j>0 do
    38                     begin
    39                          inc(k,j mod 2);
    40                          j:=j div 2;
    41                     end;
    42               if k<>l then continue;k:=0;
    43               for j:=1 to n do if (i or a[j])=i then inc(k);
    44               ans:=max(ans,k);
    45          end;
    46      writeln(ans);
    47 end.
  • 相关阅读:
    如何避免JavaScript的内存泄露及内存管理技巧
    【跟我一起学python吧】python chr()、unichr()和ord()
    阿里云,实力与担当并存!
    首届阿里白帽大会成功举办,用技术“肩天下”
    DataV数据可视化年度峰会——唤醒数据,看见未来
    支付宝移动端 Hybrid 解决方案探索与实践
    大数据上云第一课:(1)MaxCompute授权和外表操作躲坑指南
    函数计算支持应用中心功能
    Serverless 解惑——函数计算如何访问 MySQL 数据库
    开发函数计算的正确姿势——使用交互模式安装依赖
  • 原文地址:https://www.cnblogs.com/HansBug/p/4480632.html
Copyright © 2011-2022 走看看