POJ 1466 Girls and Boys (匈牙利算法 最大独立集)
来源:互联网 发布:exchange 587端口 编辑:程序博客网 时间:2024/06/05 07:16
Girls and Boys
Time Limit: 5000MS Memory Limit: 10000KTotal Submissions: 10912 Accepted: 4887
Description
In 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.
Input
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 (n <=500 ), for n subjects.
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 (n <=500 ), for n subjects.
Output
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
题目链接:http://poj.org/problem?id=1466
题目大意:一些男的和一些女的有的之间有关系,同性之间无关系,求一个最大的集合,使得里面任意两人没有关系
题目分析:裸的最大独立集问题,建立二分图,然后根据最大独立集=点数-最大匹配,求解即可,注意由于二分图是双向建立的,求出的最大匹配要除2
题目链接:http://poj.org/problem?id=1466
题目大意:一些男的和一些女的有的之间有关系,同性之间无关系,求一个最大的集合,使得里面任意两人没有关系
题目分析:裸的最大独立集问题,建立二分图,然后根据最大独立集=点数-最大匹配,求解即可,注意由于二分图是双向建立的,求出的最大匹配要除2
#include <cstdio>#include <cstring>int const MAX = 505;bool g[MAX][MAX];bool vis[MAX];int cx[MAX], cy[MAX];int n;int DFS(int x){ for(int y = 0; y < n; y++) { if(!vis[y] && g[x][y]) { vis[y] = true; if(cy[y] == -1 || DFS(cy[y])) { cy[y] = x; cx[x] = y; return 1; } } } return 0;}int MaxMatch(){ memset(cx, -1, sizeof(cx)); memset(cy, -1, sizeof(cy)); int res = 0; for(int i = 0; i < n; i++) { if(cx[i] == -1) { memset(vis, false, sizeof(vis)); res += DFS(i); } } return res;}int main(){ while(scanf("%d", &n) != EOF) { memset(g, false, sizeof(g)); for(int i = 0; i < n; i++) { int x; scanf("%d", &x); int num; scanf(": (%d)", &num); for(int j = 0; j < num; j++) { int y; scanf("%d", &y); g[x][y] = true; } } int ans = MaxMatch(); printf("%d\n", n - ans / 2); }}
0 0
- POJ 1466 Girls and Boys (匈牙利算法 最大独立集)
- POJ 1466 Girls and Boys(匈牙利算法—最大独立集)
- hdu 1068 zoj 1137 poj 1466 Girls and Boys(二分图匹配 匈牙利算法 最大独立集)
- poj 1466 Girls and Boys (最大独立)
- 【hdu 1068 Girls and Boys 最大独立集数 匈牙利算法 】
- 【HDU1068】Girls and Boys(最大独立集数,匈牙利算法)
- POJ 1466 Girls and Boys (最大独立集Hungary)
- pku(poj) 1466 Girls and Boys (最大独立集)
- POJ 1466 Girls and Boys(最大独立点集)
- POJ 1466 Girls and Boys (最大独立点集)
- POJ 1466 Girls and Boys 最大独立集
- POJ-1466-Girls and Boys(二分图最大独立集)
- POJ 1466 Girls and Boys(二分图最大独立集)
- poj 1466 Girls and Boys (最大独立集)
- poj 1466 && hdu 1068Girls and Boys(最大独立集)
- POJ 1466 Girls and Boys(二分图最大独立集)
- POJ 1466 Girls and Boys(最大独立点集)
- POJ 1466 Girls and Boys(最大独立集)
- 6.9学习内容 设置相机参数,android古怪的bug,仿微信可点击的点赞文字
- android实现图片触摸旋转
- Unity3D中的Quaternion(四元数)
- 如何衡量代码质量?
- POJ 3983:快算24
- POJ 1466 Girls and Boys (匈牙利算法 最大独立集)
- ajax(1)helloword(GET)
- 黑马程序员_多线程(死锁)
- cocos2d-x 3.6创建工程
- 在JSP页面中使用Ajax主题时的引入
- Holding Your Objects 1-4
- 二维数组和数组指针
- leetcode--Combinations
- java集合的简单例子