Marriage is Stable |
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) |
Total Submission(s): 75 Accepted Submission(s): 47 |
Problem Description
Albert, Brad, Chuck are happy bachelors who are in love with Laura, Marcy, Nancy. They all have three choices. But in fact, they do have some preference in mind. Say Albert, he likes Laura best, but that doesn't necesarily mean Laura likes him. Laura likes Chuck more than Albert. So if Albert can't marry Laura, he thinks Nancy a sensible choice. For Albert, he orders the girls Laura > Nancy > Marcy.
For the boys: Albert: Laura > Nancy > Marcy Brad: Marcy > Nancy > Laura Chuck: Laura > Marcy > Nancy For the girls: Laura: Chuck > Albert > Brad Marcy: Albert > Chuck > Brad Nancy: Brad > Albert > Chuck But if they were matched randomly, such as Albert <-> Laura Brad <-> Marcy Chuck <-> Nancy they would soon discover it's not a nice solution. For Laura, she likes Chuck instead of Albert. And what's more, Chuck likes Laura better than Nancy. So Laura and Chuck are likely to come together, leaving poor Albert and Nancy. Now it's your turn to find a stable marriage. A stable marriage means for any boy G and girl M, with their choice m[G] and m[M], it will not happen that rank(G, M) < rank(G, m[G])and rank(M, G) < rank(M, m[M]). |
Input
Each case starts with an integer n (1 <= n <= 500), the number of matches to make.
The following n lines contain n + 1 names each, the first being name of the boy, and rest being the rank of the girls. The following n lines are the same information for the girls. Process to the end of file. |
Output
If there is a stable marriage, print n lines with two names on each line. You can choose any one if there are multiple solution. Print "Impossible" otherwise. Print a blank line after each test. |
Sample Input
3 Albert Laura Nancy Marcy Brad Marcy Nancy Laura Chuck Laura Marcy Nancy Laura Chuck Albert Brad Marcy Albert Chuck Brad Nancy Brad Albert Chuck |
Sample Output
Albert Nancy Brad Marcy Chuck Laura
白书上讲的挺好的。。。用的他的算法。。用std::map<string, int> && string[]来对名字进行储存
|
Marriage is Stable (稳定婚姻匹配GS算法)
最新推荐文章于 2023-01-14 15:52:20 发布