zoukankan      html  css  js  c++  java
  • hdoj 1068 Girls and Boys【匈牙利算法+最大独立集】

    Girls and Boys

    Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 8470    Accepted Submission(s): 3890


    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<stdio.h>
    #include<string.h>
    #define MAX 1100
    int vis[MAX],map[MAX][MAX],stu[MAX];
    int t;
    int find(int x)
    {
    	int i;
    	for(i=0;i<t;i++)
    	{
    		if(map[x][i]&&vis[i]==0)
    		{
    			vis[i]=1;
    			if(stu[i]==0||find(stu[i]))
    			{
    				stu[i]=x;
    				return 1;
    			}
    		}
    	}
    	return 0;
    }
    int main()
    {
    	int n,m,i,j,sum,a,b;
    	while(scanf("%d",&t)!=EOF)
    	{
    	    memset(stu,0,sizeof(stu));
    		memset(map,0,sizeof(map));	
    		for(i=0;i<t;i++)
    		{
    			scanf("%d: (%d)",&a,&n);
    			while(n--)
    			{
    				scanf("%d",&b);
    				map[a][b]=1;
    			}
    		}
    		sum=0;
    		for(i=0;i<t;i++)
    		{
    			memset(vis,0,sizeof(vis));
    			if(find(i))
    			sum++;
    		}
    		printf("%d
    ",t-sum/2);
    	}
    	return 0;
    }
    
    
    
    
    
    
    
    
    
  • 相关阅读:
    Neo4j的查询语法笔记(二)
    NEO4J -模糊查询
    mybatis常用jdbcType数据类型
    Codrops 优秀教程:CSS 3D Transforms 实现书本效果
    案例分享:20佳应用大图片背景的优秀网站作品
    分享一套精美的现代 UI PSD 工具包【免费下载】
    经验分享:10个简单实用的 jQuery 代码片段
    Popline:帅气的浮动 HTML5 文本编辑器工具栏
    《分享》学习单页网站制作的20个优秀案例
    Minimit Anima – 硬件加速的 CSS3 动画插件
  • 原文地址:https://www.cnblogs.com/tonghao/p/4662073.html
Copyright © 2011-2022 走看看