2017 Multi-University Training Contest - Team 6 1011 Classes
2017-08-10 20:47
330 查看
Classes
[align=center]Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 191 Accepted Submission(s): 118
[/align]
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
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
[align=left]Sample Output[/align]
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 co
4000
urse 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个班每个班的学生报名ABC三种课程,求n个班中 max(只报名A的人+只报名B的人+只报名C+只报名AC+只报名BC+只报名AB+只报名ABC的人)
数据有可能是假的,假的数据直接忽略掉,保证一定有一个真的数据
题解
报名abc的人数一定是只报名abc的人数,那么只报名ab的人数就是 报名ab人数 - 只报名abc人数,ac,bc同理
只报名a的人数一定是 报名a的人数- 只报名ac的人数-只报名ab的人数 - 只报名abc的人数,b,c同理
/* *********************************************** ┆ ┏┓ ┏┓ ┆ ┆┏┛┻━━━┛┻┓ ┆ ┆┃ ┃ ┆ ┆┃ ━ ┃ ┆ ┆┃ ┳┛ ┗┳ ┃ ┆ ┆┃ ┃ ┆ ┆┃ ┻ ┃ ┆ ┆┗━┓ 马 ┏━┛ ┆ ┆ ┃ 勒 ┃ ┆ ┆ ┃ 戈 ┗━━━┓ ┆ ┆ ┃ 壁 ┣┓┆ ┆ ┃ 的草泥马 ┏┛┆ ┆ ┗┓┓┏━┳┓┏┛ ┆ ┆ ┃┫┫ ┃┫┫ ┆ ┆ ┗┻┛ ┗┻┛ ┆ ************************************************ */ #include <iostream> #include <set> #include <map> #include <stack> #include <cmath> #include <queue> #include <cstdio> #include <bitset> #include <string> #include <vector> #include <iomanip> #include <cstring> #include <algorithm> #include <functional> #define inf 0x3f3f3f3f #define debug(x) cout<<"---"<<x<<"---"<<endl typedef long long ll; using namespace std; int main() { int t; cin >> t; while (t--) { int a, b, c, d, e, f, abc; int n, ans = -1; cin >> n; while (n--) { cin >> a >> b >> c >> d >> e >> f >> abc; int ab = d - abc; int bc = e - abc; int ac = f - abc; a = a - ab - ac - abc; b = b - ab - bc - abc; c = c - ac - bc - abc; if (a < 0 || b < 0 || c < 0 || ab < 0 || ac < 0 || bc < 0 || abc < 0) { continue; } ans = max(ans, a + b + c + ab + ac + bc + abc); } cout << ans << endl; } return 0; } /************************************************ ┆ ┏┓ ┏┓ ┆ ┆┏┛┻━━━┛┻┓ ┆ ┆┃ ┃ ┆ ┆┃ ━ ┃ ┆ ┆┃ ┳┛ ┗┳ ┃ ┆ ┆┃ ┃ ┆ ┆┃ ┻ ┃ ┆ ┆┗━┓ ┏━┛ ┆ ┆ ┃ ┃ ┆ ┆ ┃ ┗━━━┓ ┆ ┆ ┃ AC代马 ┣┓┆ ┆ ┃ ┏┛┆ ┆ ┗┓┓┏━┳┓┏┛ ┆ ┆ ┃┫┫ ┃┫┫ ┆ ┆ ┗┻┛ ┗┻┛ ┆ ************************************************ */
相关文章推荐
- 2017 Multi-University Training Contest - Team 6 Classes
- 2017 Multi-University Training Contest - Team 2:1011 Regular polygon
- 2017 Multi-University Training Contest - Team 2 1011 Regular polygon【求平面中正方形的个数】
- 2017 Multi-University Training Contest - Team 7 1011 Kolakoski
- 2017 Multi-University Training Contest - Team 2:1011&hdu6095、Regular polygon
- 2017 Multi-University Training Contest - Team 7:1011. Kolakoski(模拟)
- 2017 Multi-University Training Contest - Team 1 1011&&HDU 6043 KazaQ's Socks【规律题,数学,水】
- 2017 Multi-University Training Contest - Team 5:1011&hdu6095、Rikka with Competition
- 2017 Multi-University Training Contest - Team 3 1011 RXD's date
- 2017 Multi-University Training Contest - Team 4:1011&hdu6077、Time To Get Up
- HDU 2017 Multi-University Training Contest - Team 4 1009 1011
- 2017 Multi-University Training Contest - Team 8 1011& HDU6143 Killer Names(容斥|| 第二类斯特林数)
- 2017 Multi-University Training Contest - Team 1 1011 KazaQ's Socks
- 2017 Multi-University Training Contest - Team 2 - 1011
- 【2017 Multi-University Training Contest - Team 6】Classes
- 2017 Multi-University Training Contest - Team 3:1011&hdu6066、RXD's date
- 2017 Multi-University Training Contest - Team 4 1011 Time To Get Up
- 2017 Multi-University Training Contest - Team 8 :1011&hdu6143、Killer Names
- 2017 Multi-University Training Contest - Team 9
- 2017 Multi-University Training Contest - Team 9 1003&&HDU 6163 CSGO【计算几何】