hdu2458 2010.3.6

二分图，建图的方式很特别，会想不到——没有关系的建一条边

Kindergarten

Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 111 Accepted Submission(s): 58

Problem 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. Inaddition to that, some girls and boys know each other. Now the teachers want topick some kids to play a game, which need that all players know each other. Youare 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 whoknow each other, respectively.

Each of the following M lines contains twointegers 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 theboys are numbered from 1 to B.

The last test case is followed by a linecontaining three zeros.

Output

For each test case, print a line containingthe test case number( beginning with 1) followed by a integer which is themaximum number of kids the teacher can pick.

Sample Input

2 3 3

1 1

1 2

2 3

2 3 5

1 1

1 2

2 1

2 2

2 3

0 0 0

Sample Output

Case 1: 3

Case 2: 4

Source

2008 Asia Hefei Regional Contest Online by USTC

Recommend

teddy

#include <stdio.h>
#include <string.h>#define MAX 210char map[MAX][MAX],yt[MAX];
int g,b,y[MAX];int judge(int);int main(void)
{int m,i,p,q,t,sum;t=0;scanf("%d %d %d",&g,&b,&m);while (g!=0 || b!=0 || m!=0){t++;memset(map,0,sizeof(map));while (m>0){scanf("%d %d",&p,&q);map[p][q]=1;m--;}sum=0;memset(y,0,sizeof(y));for (i=1;i<=g;i++){memset(yt,0,sizeof(yt));if (judge(i))  sum++;}printf("Case %d: %d\n",t,g+b-sum);scanf("%d %d %d",&g,&b,&m);}return 0;
}int judge(int a)
{int i;for (i=1;i<=b;i++){if (!map[a][i] && !yt[i]){yt[i]=1;if (y[i]==0 || judge(y[i])){y[i]=a;return 1;}}}return 0;
}

hdu2458 2010.3.6相关推荐

简介SharePoint 2010 14 Hive文件夹
版权声明:本文为博主原创文章.未经博主同意不得转载. https://blog.csdn.net/u012025054/article/details/36018873 简介SharePoint 20 ...
在SharePoint 2010使用OWA查看自己邮箱的内容
在SharePoint 2010使用OWA 背景: 利用 Outlook Web Access Web 部件,可以在 SharePoint 网站中显示从 Microsoft Exchange Serv ...
将moss 2007的模板文件导入到moss 2010
最近公司HR请请将一个moss2007的调查模板文件导入到我们部门的Moss protal 上面. 我想这是举手之劳,就爽快的答应了. 但是导入时却报如下错误: Error Microsoft Sha ...
[置顶]2010年东北大学ACM程序设计竞赛冬季校赛题解
8题只做出4题比较easy的题,而且做得挺麻烦,看来还要多练练. AC的题如下 NEUOJ 1112 I Love Apple Description So many people love app ...
计算机接口与通信技术考试题,全国2010年10月自学考试计算机通信接口技术试题...
全国2010年10月高等教育自学考试计算机通信接口技术试题课程代码:02369 注:接口芯片的控制字请参阅附录. 一.单项选择题(本大题共20小题,每小题1分,共20分) 在每小题列出的四个备选项 ...
某单位招聘考试需要考核数学英语计算机,2010年10月自学考试电子商务网站设计原理试题...
全国2010年10月高等教育自学考试电子商务网站设计原理试题课程代码:00906 一.单项选择题(本大题共20小题,每小题1分,共20分) 在每小题列出的四个备选项中只有一个是符合题目要求的,请将 ...
vs2008/2010安装无法打开数据文件解决方案
本人在安装VS2008或2010时,在开始的第一个页面(进度条大约加载到75%左右),提示"无法打开数据文件 'C:/Documents and Settings/Administrator ...
SharePoint 2010中的客户端AJAX应用——ASP.NET AJAX模板
WCF Data Services是SharePoint 2010中一个极具吸引力的新特性.然而,因为它的强大,直接对其进行编程仍然会有点痛苦.幸运的是,一个新的相关技术 -- ASP.Net AJA ...
2010年的退休畅想
有了确定的目标应该是终究可以实现的,比如新买的房子,每一次路过那个地方都要心里暗暗向往,闹市中还能这么安静的地方,托人也买不到的地方,以为注定与我无缘,金融危机让大家都平等了,于是拥有了.现在,我想是 ...
《统一沟通-微软-实战》-5-部署-SharePoint Server 2010
1. 登录-SP2010 2. 查看-计算机名 3. 查看-IP 4. 加域 5. 上网安装 SharePoint Server 2010 若要安装和配置 SharePoint Server 201 ...

hdu2458 2010.3.6

hdu2458 2010.3.6相关推荐

最新文章

热门文章