hdu 多校联赛 Classes
来源:互联网 发布:淘宝店铺资金被冻结 编辑:程序博客网 时间:2024/05/29 19:31
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.
ac代码:
#include<bits/stdc++.h>using namespace std;#define inf 0x3f3f3fint num[7+5];int main(){ int t,n; scanf("%d",&t); while(t--) { scanf("%d",&n); int ans = -1; for(int i = 0; i <n; ++i) { int a = inf,b = inf,c = inf,d = inf; memset(num,0,sizeof(num)); for(int i = 0; i<7; ++i) { scanf("%d",&num[i]); } d = num[0]+num[1]+num[2]-num[3]-num[4]-num[5]+num[6]; if(num[3]<=num[0]&&num[5]<=num[0]&&num[6]<=min(num[3],num[5]))//对后边几个交集判断大小关系 { a = num[3]+num[5]-num[6]; } if(num[3]<=num[1]&&num[4]<=num[1]&&num[6]<=min(num[3],num[4])) { b = num[3]+num[4]-num[6]; } if(num[4]<=num[2]&&num[5]<=num[2]&&num[6]<=min(num[4],num[5])) { c = num[4]+num[5]-num[6]; } if(a<=num[0]&&b<=num[1]&&c<=num[2]&&d>ans)//更新ans { ans = d; } } printf("%d\n",ans); } return 0;}
阅读全文
1 0
- hdu 多校联赛 Classes
- HDU6106 Classes(思路,2017 HDU多校联赛 第6场)
- hdu 多校联赛 TrickGCD
- hdu 多校联赛 Questionnaire
- hdu 多校联赛 Inversion
- 2015 HDU 多校联赛 5326 Work
- 2016多校联赛 hdu 5724 Chess
- 2016多校联赛 hdu 5728 PowMod
- HDU 5774 多校联赛第四场
- hdu 5823 2016多校联赛8
- hdu多校联赛 Balala Power!
- hdu 多校联赛 Regular polygon
- HDU 2017多校联赛-Regular polygon
- hdu 多校联赛 Maximum Sequence
- HDU 2017多校联赛-Maximum Sequence
- hdu 多校联赛 Is Derek lying?
- hdu 多校联赛 Add More Zero
- hdu 多校联赛 Colorful Tree
- lintcode 交叉链表
- sequence 跳号
- 《Deep Learning》学习1——基于特征分解的主成分分析
- Android Webview知识点和遇到过的坑全总结
- Keras深度神经框架
- hdu 多校联赛 Classes
- Git命令 未完结
- Linux 系统实时监控的瑞士军刀 —— Glances
- Oracle中快速删除某个用户下的所有表数据 禁用所有外键
- 每周荐书:分布式、深度学习算法、iOS(评论送书)
- 设置dialog窗口居中显示
- 微信小程序如何在地图上面操作样式
- Beautiful numbers [数位dp][离散化]
- BAT常用命令