HDU 6106 Classes -逻辑题-2017多效联盟6 第11题
来源:互联网 发布:股指期货模拟交易软件 编辑:程序博客网 时间:2024/05/18 22:44
Classes
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 19 Accepted Submission(s): 16
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.
Source
2017 Multi-University Training Contest - Team 6
题意:
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 <cstdio>using namespace std;int n;int main(){ int t; scanf("%d", &t); while (t > 0){ t--; scanf("%d", &n); int ans = -1; for (int i=0; i<n; i++){ int a, b, c, ab, ac, bc, abc; int a1, b1, c1, ab1, ac1, bc1, abc1; scanf("%d%d%d%d%d%d%d", &a,&b,&c,&ab,&bc,&ac,&abc); abc1 = abc; ab1 = ab - abc1; ac1 = ac - abc1; bc1 = bc - abc1; a1 = a - ab1 - ac1 - abc1; b1 = b - ab1 - bc1 - abc1; c1 = c - ac1 - bc1 - abc1; if (a1 < 0 || b1 < 0 || c1 < 0 || ab1 < 0 || bc1 < 0 || ac1 < 0 || abc1 < 0){ continue; } ans = max(ans, a1+b1+c1+ab1+bc1+ac1+abc1); } cout << ans << endl; } return 0;}
阅读全文
1 0
- HDU 6106 Classes -逻辑题-2017多效联盟6 第11题
- HDU 6077 Time To Get Up -暴力枚举-2017多校联盟4 第11题
- HDU 6095 Rikka with Competition -2017多校联盟5 第11题
- HDU6098 Inversion -2017多校联盟6 第3题
- HDU 6069 Counting Divisors -质因子个数-2017多校联盟4 第3题
- hdu6045 Is Derek lying? -逻辑题-2017多校联盟2 1题
- 2017 多校赛6 Classes hdu 6106
- HDU6106 Classes(思路,2017 HDU多校联赛 第6场)
- hdu 6106 Classes 2017多校第六场1011签到题 容斥原理
- 2017 多校训练第六场 HDU 6106 Classes
- HDU6034 Balala Power! -2017多校联盟1 第2题
- HDU6092 Rikka with Subset-01背包dp-2017多校联盟5 第8题
- HDU-2017 多校训练赛6-1011-Classes
- HDU 6106 (2017 多校训练赛6 1011)Classes
- 【2017多校】HDU 6106 Classes 【集合计算】
- HDU 6106-Classes
- HDU 6106-Classes
- hdu 6106 Classes
- 结合mint-ui移动端下拉加载实践总结
- html前端 rem布局,完美兼容各手机端的尺寸,自适应布局
- HDU 6105 Gameia [想法题]
- css中的margin、padding、border详解
- poj 1458 小白算法练习 Common Subsequence 动态规划
- HDU 6106 Classes -逻辑题-2017多效联盟6 第11题
- 静态代码块,构造代码块,普通代码块-三者的执行顺序及区别
- HDU1024 Max Sum Plus Plus ——dp
- 快速生成文档注释快捷键
- 高德地图api的自定义地点标注
- 2107-图的深度遍历
- 将tomcat注册为服务
- 用户画像的入门(转自CDC)
- hdu 1686 Oulipo (KMP裸题)