2017杭电多校第六场1011Classes
来源:互联网 发布:iqr 淘宝网官网 编辑:程序博客网 时间:2024/05/17 02:45
传送门
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.
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
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
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
224 5 4 4 3 2 25 3 1 2 0 0 020 4 10 2 3 4 96 12 6 3 5 3 2
Sample Output
715HintIn 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.
#include <iostream>#include <string>#include<algorithm>#include<cstring>#include<cstdio>using namespace std; #define ll long longint main(){ int a, b, c, ab, bc, ac, abc; int t,n,ans=0; cin >> t; while (t--) { ans = 0; cin >> n; for (int i = 0; i < n;++i) { int cnt = 0; cin >> a >> b >> c >> ab >> bc >> ac >> abc; ac =ac-abc; bc =bc-abc; ab =ab-abc; if (ab < 0 || bc < 0 || ac < 0) continue; a = a - ab - ac - abc; b = b - ab - bc - abc; c = c - ac - bc - abc; if (a < 0 || b < 0 || c < 0) continue; cnt += a + b + c + ab + ac + bc + abc; ans = max(ans, cnt); } cout << ans << endl; } return 0;}
阅读全文
0 0
- 2017杭电多校第六场1011Classes
- hdu 6106 Classes 2017多校第六场1011签到题 容斥原理
- 2017 多校训练第六场 HDU 6106 Classes
- 2017杭电多校第六场 1011 (勉强算容斥吧)HDU 6106
- 2017杭电多校第六场03Inversion
- 2017杭电多校第六场1008 Kirinriki
- Hdu6106 Classes(2017多校第6场)
- HDU 6106 Classes (简单集合运算 17多校第六场)
- 2017杭电多校第六场 1003 Inversion(暴力)HDU 6098
- 2017杭电多校第六场 1008 Kirinriki(暴力)HDU 6103
- 2017杭电多校第六场 1010 Gameia(博弈)HDU6105
- 第六章: Reusing Classes
- (2017多校训练第六场)HDU
- 2017暑假第二阶段第六场 总结
- best coder 第六场
- 2015多校赛第六场
- 计蒜客-第六场初试
- 河南省多校脸萌第六场
- Array和List的异同
- cifar10_resNet
- HTTP报文内的HTTP报文信息
- 2017.08.10小结
- ApplicationEventPublisher
- 2017杭电多校第六场1011Classes
- 第一篇博客
- Viewparge(无限轮播)
- Summer Training day6 codeforces787D 最短路spfa,线段树建图
- Perlin noise(二)
- udp
- 二维spfa [JLOI2011]飞行路线
- mongos分片集群下db数量过多导致服务不可用
- POJ 2236Wireless Network