
ZOJ Problem Set  3120
The stable marriage problem consists of matching members of two different sets according to the member's preferences for the other set's members. The input for our problem consists of:
A marriage is a onetoone mapping between males and females. A marriage is called stable, if there is no pair (m, f) such that f ∈ F prefers m ∈ M to her current partner and m prefers f over his current partner. The stable marriage A is called maleoptimal if there is no other stable marriage B, where any male matches a female he prefers more than the one assigned in A. Given preferable lists of males and females, you must find the maleoptimal stable marriage. Input The first line gives you the number of tests. The first line of each test case contains integer n (0 < n < 27). Next line describes n male and n female names. Male name is a lowercase letter, female name is an uppercase letter. Then go n lines, that describe preferable lists for males. Next n lines describe preferable lists for females. Output For each test case find and print the pairs of the stable marriage, which is maleoptimal. The pairs in each test case must be printed in lexicographical order of their male names as shown in sample output. Output an empty line between test cases. Sample Input 2 3 a b c A B C a:BAC b:BAC c:ACB A:acb B:bac C:cab 3 a b c A B C a:ABC b:ABC c:BCA A:bac B:acb C:abc Sample Output a A b B c C a B b A c C Source: The SouthEastern European Regional Contest 2007 