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 1 to N), 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 numbers a, b (a ̸= b),said there is a game between a and b.
T
Wrestling Match (dfs乱搞染色)
最新推荐文章于 2021-01-29 18:54:24 发布