【HDU 5971 Wrestling Match】+ 2016ACM/ICPC亚洲区大连站-重现赛（感谢大连海事大学） + 二分图染色

最新推荐文章于 2020-03-04 21:43:00 发布

楚江枫

最新推荐文章于 2020-03-04 21:43:00 发布

阅读量1.1k

点赞数

分类专栏：二分图

本文链接：https://blog.csdn.net/WYK1823376647/article/details/53142448

版权

该博客讨论了如何使用二分图染色算法解决一个摔跤比赛的问题，其中裁判需要将参赛者分为'好球员'和'坏球员'。题目给出了输入输出示例，并指出在已知部分球员属性的基础上，通过二分图染色来判断所有球员是否可以被正确划分。代码实现被提及，但未直接给出。

摘要由CSDN通过智能技术生成

Wrestling Match
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 363 Accepted Submission(s): 170

Problem Description
Nowadays, at least one wrestling match is held every year in our country. There are a lot of people in the game is “good player”, the rest is “bad player”. Now, Xiao Ming is referee of the wrestling match and he has a list of the matches in his hand. At the same time, he knows some people are good players,some are bad players. He believes that every game is a battle between the good and the bad player. Now he wants to know whether all the people can be divided into “good player” and “bad player”.

Input
Input contains multiple sets of data.For each set of data,there are four numbers in the first line:N (1 ≤ N≤ 1000)、M(1 ≤M ≤ 10000)、X,Y(X+Y≤N ),in order to show the number of players(numbered 1toN ),the number of matches,the number of known “good players” and the number of known “bad players”.In the next M lines,Each line has two numbersa, b(a≠b) ,said there is a game between a and b .The next line has X different numbers.Each number is known as a “good player” number.The last line contains Y different numbers.Each number represents a known “bad player” number.Data guarantees there will not be a player number is a good