zoukankan      html  css  js  c++  java
  • HDU 6106 Classes (水题)

    Classes

    2017ACM暑期多校联合训练 - Team 6 10011 Classes
    题目链接

    Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
    Total Submission(s): 562 Accepted Submission(s): 360

    Problem Description
    The school set up three elective courses, assuming that these courses are A, B, C. N classes of students enrolled in these courses.
    Now the school wants to count the number of students who enrolled in at least one course in each class and records the maximum number of students.
    Each class uploaded 7 data, the number of students enrolled in course A in the class, the number of students enrolled in course B, the number of students enrolled in course C, the number of students enrolled in course AB, the number of students enrolled in course BC, the number of students enrolled in course AC, the number of students enrolled in course ABC. The school can calculate the number of students in this class based on these 7 data.
    However, due to statistical errors, some data are wrong and these data should be ignored.
    Smart you must know how to write a program to find the maximum number of students.

    Input
    The first line of the input gives the number of test cases T; T test cases follow.
    Each case begins with one line with one integer N, indicates the number of class.
    Then N lines follow, each line contains 7 data: a, b, c, d, e, f, g, indicates the number of students enrolled in A, B, C, AB, BC, AC, ABC in this class.
    It’s guaranteed that at least one data is right in each test case.

    Limits

    T≤100
    1≤N≤100
    0≤a,b,c,d,e,f,g≤100

    Output
    For each test case output one line contains one integer denotes the max number of students who enrolled in at least one course among N classes.

    Sample Input
    2
    2
    4 5 4 4 3 2 2
    5 3 1 2 0 0 0
    2
    0 4 10 2 3 4 9
    6 12 6 3 5 3 2

    Sample Output
    7
    15

    Hint

    In the second test case, the data uploaded by Class 1 is wrong.
    Because we can’t find a solution which satisfies the limitation.
    As for Class 2, we can calculate the number of students who only enrolled in course A is 2,
    the number of students who only enrolled in course B is 6, and nobody enrolled in course C,
    the number of students who only enrolled in courses A and B is 1,
    the number of students who only enrolled in courses B and C is 3,
    the number of students who only enrolled in courses A and C is 1,
    the number of students who enrolled in all courses is 2,
    so the total number in Class 2 is 2 + 6 + 0 + 1 + 3 + 1 + 2 = 15.

    Source
    2017 Multi-University Training Contest - Team 6

    按照题意,对数据依次进行模拟,找到符合的,且最大的就是答案

    #include<cstdio>
    #include<algorithm>
    using namespace std;
    int main()
    {
        int a,b,c,d,e,f,g;
        int maxx,ans,T,n;
        scanf("%d",&T);
        while(T--)
        {
            maxx=0;
            scanf("%d",&n);
            while(n--)
            {
                scanf("%d%d%d%d%d%d%d",&a,&b,&c,&d,&e,&f,&g);
                d-=g;
                e-=g;
                f-=g;
                a=a-(d+f+g);
                b=b-(d+e+g);
                c=c-(e+f+g);
                if(a<0||b<0||c<0||d<0||e<0||f<0||g<0)
                    continue;
                ans=a+b+c+d+e+f+g;
                if(ans>maxx)
                    maxx=ans;
            }
            printf("%d
    ",maxx);
        }
        return 0;
    }
  • 相关阅读:
    【bzoj2079】[Poi2010]Guilds 构造结论题
    【bzoj1899】[Zjoi2004]Lunch 午餐 dp
    【bzoj1345】[Baltic2007]序列问题Sequence 单调栈
    【bzoj1047】[HAOI2007]理想的正方形 二维RMQ
    【bzoj1044】[HAOI2008]木棍分割 二分+dp
    【bzoj5037】[Jsoi2014]电信网络 最大权闭合图
    【bzoj5018】[Snoi2017]英雄联盟 背包dp
    【bzoj5020】[THUWC 2017]在美妙的数学王国中畅游 泰勒展开+LCT
    【bzoj2213】[Poi2011]Difference dp
    【bzoj2161】布娃娃 权值线段树
  • 原文地址:https://www.cnblogs.com/nanfenggu/p/7900063.html
Copyright © 2011-2022 走看看