杭电1068 (二分图的独立点集)Girls and Boys
来源:互联网 发布:haproxy acl 端口复用 编辑:程序博客网 时间:2024/06/05 07:48
Girls and Boys
Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9448 Accepted Submission(s): 4310
Problem Description
the second year of the university somebody started a study on the romantic relations between the students. The relation “romantically involved” is defined between one girl and one boy. For the study reasons it is necessary to find out the maximum set satisfying the condition: there are no two students in the set who have been “romantically involved”. The result of the program is the number of students in such a set.
The input contains several data sets in text format. Each data set represents one set of subjects of the study, with the following description:
the number of students
the description of each student, in the following format
student_identifier:(number_of_romantic_relations) student_identifier1 student_identifier2 student_identifier3 ...
or
student_identifier:(0)
The student_identifier is an integer number between 0 and n-1, for n subjects.
For each given data set, the program should write to standard output a line containing the result.
The input contains several data sets in text format. Each data set represents one set of subjects of the study, with the following description:
the number of students
the description of each student, in the following format
student_identifier:(number_of_romantic_relations) student_identifier1 student_identifier2 student_identifier3 ...
or
student_identifier:(0)
The student_identifier is an integer number between 0 and n-1, for n subjects.
For each given data set, the program should write to standard output a line containing the result.
Sample Input
70: (3) 4 5 61: (2) 4 62: (0)3: (0)4: (2) 0 15: (1) 06: (2) 0 130: (2) 1 21: (1) 02: (1) 0
Sample Output
52
题目大意:找到一个集合,使得其中的所有人之间不能恋爱。
解题思路:先找到能够恋爱的人的关系,再分析题目。
这里给出实例说话:例如样例中2
0 1 2
1 0
2 0
中,0和1可以恋爱,0和2也可以恋爱,但是1和2之间不能恋爱,则1 2之间组成的集合的元素的个数就是题中的解。那么我们就要研究如何把0去掉,去掉了他,我们就有了最大集合元素个数。这个时候就要用到匈牙利算法--二分图匹配。
我们可以通过二分匹配的算法求出能够恋爱的组数,因为这里是双向图,所以我们现在得到的组数实际是人数并不是组数,所以我们得到的数要除以2,所得到的数才是能够恋爱的最大组数,这个时候我们只需要拆散他们就行了。扔一个,留一个。去掉的人不加入集合,留下的人加入集合,就得到了题目所求的东西。
这里直接上AC完整代码:
#include<stdio.h>#include<string.h>using namespace std;int map[501][501];//WA的原因也可能是数组开的不对。int vis[501];int match[501];int n;int find(int x){ for(int i=0;i<n;i++) { if(vis[i]==0&&map[x][i]==1) { vis[i]=1; if(match[i]==-1||find(match[i])) { match[i]=x; return 1; } } } return 0;}int main(){ while(~scanf("%d",&n)) { memset(map,0,sizeof(map)); memset(match,-1,sizeof(match)); for(int i=0;i<n;i++) { int x,y,q; scanf("%d: (%d)",&x,&q); for(int j=0;j<q;j++) { scanf("%d",&y); map[x][y]=1; } } int output=0; for(int i=0;i<n;i++) { memset(vis,0,sizeof(vis)); if(find(i)) output++; } printf("%d\n",n-output/2); }}
0 0
- 杭电1068 (二分图的独立点集)Girls and Boys
- hdu 1068 Girls and Boys(二分图求最大独立点集)
- hdu Girls and Boys(二分图的最大独立集)
- POJ 1466:Girls and Boys 二分图的最大点独立集
- HDU 1068 Girls and Boys(二分图最大独立点集,3级)
- hdu 1068 Girls and Boys(二分图匹配---最大独立点集)
- zoj - 1137 - Girls and Boys(二分图最大独立点集)
- POJ 1466 Girls and Boys(二分图匹配+拆点+最大独立集)
- (step6.3.2)hdu 1068(Girls and Boys——二分图的最大独立集)
- HDU 1068 Girls and Boys (匈牙利算法 二分图的最大独立集数 )
- 【二分图匹配(最大独立集)】hdu 1068 Girls and Boys
- HDOJ题目1068Girls and Boys(二分图最大独立集,匈牙利算法模板)
- hdu 1068 Girls and Boys(二分图+最大独立集)
- hdu 1068 girls and boys(二分图求最大独立集)
- HDU 1068 Girls and Boys(二分图匹配+最大独立集+匈牙利算法)
- HDU【1068】Girls And Boys(二分图+模板+最大独立集)
- 【二分图|最大点独立集】POJ-1466 Girls and Boys
- POJ 1466 && ZOJ 1137--Girls and Boys【二分图 && 最大点独立集】
- 航电acm--2107
- <LeetCode OJ> 225. Implement Stack using Queues
- ListCtrl常见使用方法
- Python中函数的参数定义和可变参数
- java12.语言进阶------本地文件操作---文件的创建、删除、重命名
- 杭电1068 (二分图的独立点集)Girls and Boys
- CALayer - 3
- opencv calibration demo 阅读笔记
- BZOJ 3208 花神的秒题计划Ⅰ
- 形参个数可变, NSNumber和NSValue,获得Class
- 银行家算法的数组方式实现
- MyEclipse设置注释格式
- STM8S103编译出错 bad struct/union operand
- Bitmap 二次采样实现