hdu 3551 Hard Problem 一般图最大匹配+给出一个无向图，存在重边，没有自环。问能否删除一些边，使得每个顶点的度数为指定度数

最新推荐文章于 2021-02-17 02:29:22 发布

kongming_acm

最新推荐文章于 2021-02-17 02:29:22 发布

阅读量2.1k

点赞数

分类专栏： acm_网络流文章标签： integer pair output each graph input

本文链接：https://blog.csdn.net/kongming_acm/article/details/6870704

版权

本文探讨了一个图论问题，即如何通过删除无向图中的边，使每个顶点的度数达到指定值。通过预处理每个顶点的度数，如果度数等于已连接的边数，该边不能删除。当两个顶点的度数大于目标值时，它们之间的边可以删除。通过将节点拆分并建立新的图，求解一般图的最大匹配，如果存在完美匹配，则表示可以达到目标状态，输出“YES”，否则输出“NO”。

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

Problem Description

This is the most tough task in this contest, do not try it until you solve all the other tasks or you feel boring on others. Given an undirected graph, you are to find out a subgraph of it so that the degree of the i-th node in the subgraph is the given integer D _i. The subgraph is a subset of edges and all vertexes are reserved. Notice that the graph may be disconnected, and two edges may connect the same vertexes, but no self cyclic exists.

Input

The input contains several test cases, the first line of the input contains an integer T denoting the number of test cases.
For each test case, the first line contains two integers N and M, denoting the number of vertexes and number of edges in the graph. (1 <= N <= 50, 1 <= M <= 200)
For the next M lines, each line contains two integers X and Y, denote there is a edge between X-th node and Y-th node. (1 <= X, Y <= N)
For the last N lines, each line contains a single integer D _i, denote the degree of i-th node in the subgraph.

Output

For each test case, if the subgraph exist, output "YES", otherwise output "NO". See sample output for further details