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;
    }
    
    
    
    
    
    
    
    
    
  • 相关阅读:
    如何:使用向导来处理项目模板 【转载】
    .NET : 如何在生成XML文档时绑定样式表
    如何在生产环境部署K2的流程
    SQL Server 数据库文档生成工具开源项目【合作邀请】
    新的纪元
    SharePoint : 谁说WSS不支持审核
    C++ : 类型的别名和对象的别名
    C++: 引用和地址运算符
    Infopath : 如何通过代码复制格式文本框的值
    正确地使用投影仪和移动硬盘
  • 原文地址:https://www.cnblogs.com/tonghao/p/4662073.html
Copyright © 2011-2022 走看看