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

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

    Time Limit: 5 Sec  Memory Limit: 64 MB Submit: 720  Solved: 466 [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).
    暴力枚举哪些病可以得就行了
    #include <cstdio>
    #include <cstring>
    char buf[10000000], *ptr = buf - 1;
    inline int readint(){
        int f = 1, n = 0;
        char ch = *++ptr;
        while(ch < '0' || ch > '9'){
            if(ch == '-') f = -1;
            ch = *++ptr;
        }
        while(ch <= '9' && ch >= '0'){
            n = (n << 1) + (n << 3) + ch - '0';
            ch = *++ptr; 
        }
        return f * n;
    }
    const int maxn = 1000 + 10;
    int s[maxn] = {0}, t[32768];
    int main(){
        fread(buf, sizeof(char), sizeof(buf), stdin);
        int N, D, K, Max;
        N = readint();
        D = readint();
        K = readint();
        Max = (1 << D) - 1;
        for(int x, i = 1; i <= N; i++){
            x = readint();
            while(x--) s[i] |= 1 << readint() - 1;
        }
        int ans = 0;
        t[0] = 0;
        for(int sum, i = 1; i <= Max; i++){
            t[i] = t[i ^ (i & -i)] + 1;
            if(t[i] > K) continue;
            sum = 0;
            for(int j = 1; j <= N; j++)
                if((i & s[j]) == s[j]) sum++;
            if(sum > ans) ans = sum;
        }
        printf("%d
    ", ans);
        return 0;
    }
  • 相关阅读:
    postgresql数据迁移
    编译安装或者mysql启动时遇到的错误小记
    安装数据库时提示重启删除 以下注册信息则不用重启
    ​sql2008安装提示报错,.必须使用"角色管理工具"安装或配置Microsoft.net.framework 3.5 sp1
    windows10 安装jdk13.0.1 与 apache-jmeter-5.1.1
    Axure RP 9 获取验证码发送倒计时
    PHP 重定向跳转页面使用post传参
    用 PHPExcel 导入excel表格并展示到前台
    当失去焦点时 验证时分秒 并提示
    iptables 防止syn ddos ping攻击
  • 原文地址:https://www.cnblogs.com/ruoruoruo/p/7531285.html
Copyright © 2011-2022 走看看