hdu 1068 Girls and Boys(最大独立集·maxmatch匈牙利)
来源:互联网 发布:linux怎么打开文件 编辑:程序博客网 时间:2024/05/06 01:14
题目:http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=19391
Girls and Boys
Time Limit: 10000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64u
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
Source
Southeastern Europe 2000
求不属于匹配关系的人数。
二分最大匹配后的匹配数是结果的2倍:
最大独立集=总个数-最大匹配数(U=n-maxmatch+maxmatch/2=n-maxmatch/2,n-maxmatch是绝对的未匹配,+maxmatch/2是加上完全拆开后的独立个数)。综上,敲代码。。。
#include <iostream>#include <cstdio>#include <cstring>using namespace std;const int maxn=1e3+5;bool bmap[maxn][maxn],bmask[maxn];int nx,ny;int cx[maxn],cy[maxn];int times=0;int findpath(int u){ for(int j=1;j<=ny;j++){ if(bmap[u][j] && !bmask[j]){ bmask[j]=1; if(cy[j]==-1 || findpath(cy[j])){ cy[j]=u; cx[u]=j; return 1; } } } return 0;}int maxmatch(){ int res=0; memset(cx,-1,sizeof(cx)); memset(cy,-1,sizeof(cy)); for(int i=1;i<=nx;i++){ if(cx[i]==-1){ for(int j=1;j<=ny;j++) bmask[j]=0; res+=findpath(i); } } return res;}int main(){ //freopen("cin.txt","r",stdin); int n; while(cin>>n){ nx=ny=n; memset(bmap,0,sizeof(bmap)); int ix,iy,rela; while(n--){ scanf("%d",&ix); while(getchar()!='('); scanf("%d)",&rela); while(rela--){ scanf("%d",&iy); bmap[ix+1][iy+1]=1; } } int ans=maxmatch(); ans=nx-ans+ans/2; printf("%d\n",ans); } return 0;}
0 0
- hdu 1068 Girls and Boys(最大独立集·maxmatch匈牙利)
- 【hdu 1068 Girls and Boys 最大独立集数 匈牙利算法 】
- hdu 1068 boys and girls(最大独立点集 ,匈牙利算法)
- hdu 1068 Girls and Boys(匈牙利算法求最大独立集)
- hdu 1068 Girls and Boys 匈牙利算法求最大独立集
- HDU 1068 Girls and Boys(二分图匹配+最大独立集+匈牙利算法)
- hdu 1068 Girls and Boys 最大独立集(最大匹配)
- hdu 1068 Girls and Boys(最大独立集,二分匹配)
- HDU 1068 Girls and Boys(最大独立集)
- hdu 1068 Girls and Boys (最大独立集)
- HDU 1068 Girls and Boys 二分最大独立集
- HDU 1068 Girls and Boys 最大独立集
- hdu 1068 Girls and Boys(最大独立集)
- HDU 1068 boys and girls(最大独立集)
- hdu 1068 Girls and Boys 【最大独立集】
- HDU 1068 — Girls and Boys 最大独立集
- HDU 1068 Girls and Boys【最大独立集】
- poj 1466 && hdu 1068Girls and Boys(最大独立集)
- 使用哪种重载的问题
- Jquery .ajax方法分析(一)
- 安卓操作栏,菜单栏的生成
- 离职后,我们该如何处理社保!
- easyiui textbox 光标 聚焦
- hdu 1068 Girls and Boys(最大独立集·maxmatch匈牙利)
- Tomcat配置虚拟目录、多域名、多个Http监听端口的方式
- 一次数据库相关操作卡住的排查--enq: TX - row lock contention
- 不安装oracle客户端,用plsql连接oracle
- C++初始化函数列表
- JAVA_SE系列:01.计算机软件及JAVA语言的背景和发展历史
- unity3d5.1物体椭圆旋转选择界面实现(一)
- 在Windows下安装Cygwin和Hadoop的方案和注意事项
- 多线程六 经典线程同步之信号量Semaphore