hdu 6106 Classes(容斥)
来源:互联网 发布:python图形化界面开发 编辑:程序博客网 时间:2024/05/16 13:58
Classes
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 303 Accepted Submission(s): 195
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.
保证每一单独的部分大于0
#include<cstdio>#include<cstdlib>#include<cstring>#include<iostream>#include<cmath>#include<string>#include <bits/stdc++.h>using namespace std;const int N =100000+10;int a[N];int main(){ int t; scanf("%d", &t); while(t--) { int n, k; scanf("%d", &n); int maxt=0; for(int i=1;i<=n;i++) { for(int j=1;j<=7;j++) scanf("%d",&a[j]); a[1]=a[1]-a[4]-a[6]+a[7]; a[2]=a[2]-a[4]-a[5]+a[7]; a[3]=a[3]-a[5]-a[6]+a[7]; a[4]=a[4]-a[7]; a[5]=a[5]-a[7]; a[6]=a[6]-a[7]; int ans=a[1]+a[2]+a[3]+a[4]+a[5]+a[6]+a[7]; sort(a+1,a+8); if(a[1]>=0) maxt=max(maxt,ans); } cout<<maxt<<endl; } return 0;}
阅读全文
0 0
- hdu 6106 Classes(容斥)
- 多校6 HDU-6106 Classes 容斥原理
- hdu 6106 Classes 2017多校第六场1011签到题 容斥原理
- HDU 6106-Classes
- HDU 6106-Classes
- hdu 6106 Classes
- hdu-6106-Classes
- HDU 6106 Classes
- HDU 6106 Classes【水题】
- 【HDU 6106 Classes】
- hdu 6106 Classes (二分)
- HDU 6106 Classes 【】
- HDU 6106 Classes (水题)
- HDU 6106 Classes
- HDU 6106 Classes
- HDU 6106 Classes
- HDU 6106 Classes【简单思维】
- HDU 6106 Classes(水~)
- WPF 按钮支持回车事件
- 百度地图打印开发_地图打印
- EXCEL导出—POI
- 尺取法的小讲解
- 安卓实训笔记第四天(补)并第五天
- hdu 6106 Classes(容斥)
- HDU 2795 线段树
- 代理服务器工作原理是什么?
- QNX手册学习笔记——IPC(4)
- ABAP中OO的方式实现金额大写转化
- Java常用基础类之Date、Calendar、SimleDateFormat
- 从码云拉项目的方法
- Python3学习(10)--列表生成器(List generator)
- 问题 : 小丑排序