HDU 6106 (2017 多校训练赛6 1011)Classes
2017-08-10 17:29
447 查看
2017 Multi-University Training Contest - Team 6 1011
Classes
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0
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.
题意:
有n个班,每个班给出报名 A,B,C,AB,AC,BC,ABC 这些课程的人数,问至少报名一个课程的人有多少
分析:
找出那些数据是错误的,剩下的直接容斥输出最大的
AC代码:
#include <iostream> #include <cstdio> #include <cmath> #include <vector> #include <cstdlib> #include <algorithm> #include <cstring> #define LL long long using namespace std; int main() { int T; scanf("%d", &T); while(T--) { int n; scanf("%d", &n); int a, b, c, ab, bc, ac, abc; int ans = 0; for(int i = 0; i < n; i++) { scanf("%d%d%d%d%d%d%d",&a, &b, &c, &ab, &bc, &ac, &abc); if(a-ab-ac+abc >= 0 && b-ab-bc+abc >=0 && c-ac-bc+abc >= 0 && ab <=min(a, b) && bc <= min(b, c) && ac <= min(a, c) && abc <= min(ab,min(bc,ac))) ans = max(ans, a+b+c-ab-bc-ac+abc); } printf("%d\n",ans); } }
相关文章推荐
- HDU-2017 多校训练赛6-1011-Classes
- 2017 多校训练第六场 HDU 6106 Classes
- HDU-2017 多校训练赛7-1011-Kolakoski
- HDU 6043(2017 多校训练赛1 1011) KazaQ's Socks
- HDU 6055 (2017 多校训练赛2 1011)Regular polygon
- HDU 2017 多校联合训练赛2 1011 6055 Regular polygon map&pair
- HDU 2017 多校联合训练赛8 1011 6143 Killer Names 排列组合
- HDU-2017 多校训练赛8-1011-Killer Names
- 【2017多校】HDU 6106 Classes 【集合计算】
- HDU-2017 多校训练赛2-1011-Regular polygon
- HDU 2017 多校联合训练赛8 1008 6140 Hybrid Crystals
- HDU 2017 多校联合训练赛5 5008 6092 Rikka with sebset
- HDU-2017 多校训练赛8-1006-Fleet of the Eternal Throne
- HDU-2017 多校训练赛4-1003-Counting Divisors
- HDU 2017 多校联合训练赛6 1008 6103 Kirinriki 优美的暴力
- HDU-2017 多校训练赛5-1008-Rikka with Subset
- HDU-2017 多校训练赛7-1008-Hard challenge
- HDU 6043 (2017 多校训练赛1 1002) Balala Power!
- HDU 2017 多校联合训练赛7 1008 6127 Hard challenge (重载运算符)
- hdu 6055 : Regular polygon (2017 多校第二场 1011) 【计算几何】