hdu Marriage Match II 完全不同的最大匹配方案的个数

Marriage Match II

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)

Total Submission(s) : 6   Accepted Submission(s) : 5

Problem Description

Presumably, you all have known the question of stable marriage match. A girl will choose a boy; it is similar as the game of playing house we used to play when we are kids. What a happy time as so many friends playing together. And it is normal that a fight or a quarrel breaks out, but we will still play together after that, because we are kids. 
Now, there are 2n kids, n boys numbered from 1 to n, and n girls numbered from 1 to n. you know, ladies first. So, every girl can choose a boy first, with whom she has not quarreled, to make up a family. Besides, the girl X can also choose boy Z to be her boyfriend when her friend, girl Y has not quarreled with him. Furthermore, the friendship is mutual, which means a and c are friends provided that a and b are friends and b and c are friend. 
Once every girl finds their boyfriends they will start a new round of this game—marriage match. At the end of each round, every girl will start to find a new boyfriend, who she has not chosen before. So the game goes on and on.
Now, here is the question for you, how many rounds can these 2n kids totally play this game?

 

 

Input

There are several test cases. First is a integer T, means the number of test cases. 
Each test case starts with three integer n, m and f in a line (3<=n<=100,0<m<n*n,0<=f<n). n means there are 2*n children, n girls(number from 1 to n) and n boys(number from 1 to n).
Then m lines follow. Each line contains two numbers a and b, means girl a and boy b had never quarreled with each other. 
Then f lines follow. Each line contains two numbers c and d, means girl c and girl d are good friends.

 

 

Output

For each case, output a number in one line. The maximal number of Marriage Match the children can play.

 

 

Sample Input

1
4 5 2
1 1
2 3
3 2
4 2
4 4
1 4
2 3

 题目意思就是求有多少完全不同的最大匹配方案，开始还理解错了，以为是只要有一个不同的就算一次新的方案呢，现在要求完全不同的匹配方案，只需要求一次HK之后，将所有的匹配边删除掉再做HK就好了，直到某一次最大匹配比前一次小了就停止。在这之前由朋友的朋友是朋友，所以建图的时候注意，可以用并查集维护一下朋友关系。

转载于:https://www.cnblogs.com/lmnx/archive/2012/04/30/2476725.html