【HDU1068】Girls and Boys(最大独立集数,匈牙利算法)
来源:互联网 发布:科学网 博弈 复杂网络 编辑:程序博客网 时间:2024/05/19 05:31
http://acm.hdu.edu.cn/showproblem.php?pid=1068
Girls and Boys
Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 12150 Accepted Submission(s): 5725
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.
Sample Input
7
0: (3) 4 5 6
1: (2) 4 6
2: (0)
3: (0)
4: (2) 0 1
5: (1) 0
6: (2) 0 1
3
0: (2) 1 2
1: (1) 0
2: (1) 0
Sample Output
5
2
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int k;int vis[515];int fr[515][515];int f[515];bool find(int x){ for(int i=0;i< k;i++) { if(!vis[i] && fr[x][i]) { vis[i]=true; if(f[i]==-1||find(f[i])) { f[i]=x; return true; } } } return false;}int main(){ int a,b; int ans; while(~scanf("%d",&k)) { memset(f,-1,sizeof(f)); memset(fr,false,sizeof(fr)); for(int i=0;i< k;i++) { scanf("%d: (%d)",&a,&b); while(b--) { int t; scanf("%d",&t); fr[a][t]=true; fr[t][a]=true; } } ans=0; for(int i=0;i< k;i++) { memset(vis,false,sizeof(vis)); if(find(i)) ans++; } ans=k-(ans/2); printf("%d\n",ans); }return 0;}
- 【HDU1068】Girls and Boys(最大独立集数,匈牙利算法)
- 【hdu 1068 Girls and Boys 最大独立集数 匈牙利算法 】
- HDU 1068 Girls and Boys (匈牙利算法 二分图的最大独立集数 )
- 【杭电oj】1068 - Girls and Boys(最大独立集数,匈牙利算法)
- hdu1068 Girls and Boys 最大独立集
- hdu1068 Girls and Boys最大独立集
- hdu1068 Girls and Boys 最大独立集
- hdu1068 Girls and Boys --- 最大独立集
- HDU1068 Girls and Boys 【最大独立集】
- HDU1068 Girls and Boys(最大独立集)
- HDU1068 (最大独立集)Girls and Boys
- hdu1068 Girls and Boys(最大点独立集)
- hdu1068-Girls and Boys(最大独立集,匹配问题)
- POJ 1466 Girls and Boys (匈牙利算法 最大独立集)
- hdu1068 Girls and Boys (二分图最大独立集)
- HDU1068-Girls and Boys(二分图_最大独立集)
- hdu1068 Girls and Boys,二分图最大独立集
- HDOJ 1068 Girls And Boys (最大独立集数)
- 建筑工程师的转行学计算机科学与技术的抉择
- c#多人聊天室
- 使用echarts实现动态显示折线图
- NOIP2013华容道 大爆搜
- Android N DisplayManager服务解析(二)
- 【HDU1068】Girls and Boys(最大独立集数,匈牙利算法)
- ActiveMQ整合Spring
- 虚树学习小结
- windows安装sbt以及eclipse 安装scala插件
- strongloop loopback 禁用指定API
- ros_indigo的catkin
- MD5加密
- SpringMVC起步--Hello SpringMVC
- python变量和数据类型