POJ 3692 Kindergarten (二分图 最大团)
来源:互联网 发布:wifi破解源代码 c语言 编辑:程序博客网 时间:2024/04/27 21:26
Description
In a kindergarten, there are a lot of kids. All girls of the kids know each other and all boys also know each other. In addition to that, some girls and boys know each other. Now the teachers want to pick some kids to play a game, which need that all players know each other. You are to help to find maximum number of kids the teacher can pick.
Input
The input consists of multiple test cases. Each test case starts with a line containing three integers
G, B (1 ≤ G, B ≤ 200) and M (0 ≤ M ≤ G × B), which is the number of girls, the number of boys and
the number of pairs of girl and boy who know each other, respectively.
Each of the following M lines contains two integers X and Y (1 ≤X≤ G,1 ≤ Y ≤ B), which indicates that girl X and boy Y know each other.
The girls are numbered from 1 to G and the boys are numbered from 1 to B.
The last test case is followed by a line containing three zeros.
Output
For each test case, print a line containing the test case number( beginning with 1) followed by a integer which is the maximum number of kids the teacher can pick.
Sample Input
2 3 31 11 22 32 3 51 11 22 12 22 30 0 0
Sample Output
Case 1: 3Case 2: 4
Source
题目链接:http://poj.org/problem?id=3692
题目大意:一些男生和女生,男生们相互都认识,女生们相互都认识,给出男女生的认识关系,要求一个最大的集合,集合中任意两个人都互相认识,求这个最大集合的元素个数
题目分析:二分图最大团问题,根据定理:
二分图最大团=原图补图的最大独立集
最大独立集=总点数-最大匹配
用匈牙利算法解出原图补图的最大匹配即可算出最大团中元素个数 (注:一般图的最大团问题是NP问题)
代码:
#include <cstdio>#include <cstring>int const MAX = 205;int cx[MAX], cy[MAX];bool vis[MAX], map[MAX][MAX];int g, b, m;int DFS(int x){ for(int y = 1; y <= b; y++) { if(!vis[y] && map[x][y]) { vis[y] = true; if(cy[y] == -1 || DFS(cy[y])) { cy[y] = x; cx[x] = y; return 1; } } } return 0;}int MaxMatch(){ int ans = 0; memset(cx, -1, sizeof(cx)); memset(cy, -1, sizeof(cy)); for(int i = 1; i <= g; i++) { if(cx[i] == -1) { memset(vis, false, sizeof(vis)); ans += DFS(i); } } return ans;}int main(){ int ca = 1; while(scanf("%d %d %d", &g, &b, &m) != EOF && (g + b + m)) { memset(map, true, sizeof(map)); for(int i = 0; i < m; i++) { int u, v; scanf("%d %d", &u, &v); map[u][v] = false; } printf("Case %d: %d\n", ca ++, g + b - MaxMatch()); }}
- POJ 3692 Kindergarten (二分图 最大团)
- poj 3692 Kindergarten,二分图的最大团
- POJ 3692 Kindergarten(二分图最大团)
- POJ 3692 Kindergarten(二分图最大团)
- poj 3692 Kindergarten(最大团,二分图匹配)
- Poj 3692 Kindergarten【最大团】
- POJ 3692:Kindergarten(最大团)
- poj 3692 -- Kindergarten(最大团,匈牙利)
- Poj 3692 二分图最大团
- poj 3692 (二分图最大团)
- POJ2692 Kindergarten 最大团 + 补图二分图
- HDU 2458Kindergarten(二分图 最大团点数)
- POJ 3692 Kindergarten 最大团->最大独立集
- poj 3692 Kindergarten (最大团模板题)
- poj 3692 (二分图的最大团)
- 3692 Kindergarten //MaxMatch 二分图求最大团
- poj 3692 Kindergarten 【最大团 = 补图最大独立集 = 补图节点数 - 补图最大匹配】
- 【二分图+技巧性】北大 poj 3692 Kindergarten
- Asynctask解析以及注意事项
- gdb调试--汇编指令处断点
- 2015070305 - EffactiveJava笔记 - 第55条 谨慎地进行优化(1)
- iOS开发UI篇—程序启动原理和UIApplication
- Android自定义搜索框(EditText)的搜索功能实现,过滤ListView
- POJ 3692 Kindergarten (二分图 最大团)
- C++可调用对象适配器和绑定器
- poj 3071 Football 概率dp
- Mybatis 的小笔记 1. Mybatis创建 引用 关闭 和生命周期
- 8.16位中断程序
- Eclipse在线集成maven M2eclipse插件
- js的入门文章
- 什么时候用C而不用C++?
- 阿里巴巴产品实习生4天