HDU 5823 Color II [状压dp] [图的色数]

最新推荐文章于 2018-10-25 23:55:45 发布

JacquesdeH

最新推荐文章于 2018-10-25 23:55:45 发布

阅读量578

点赞数

分类专栏：动态规划状压dp 文章标签：动态规划状压dp

本文链接：https://blog.csdn.net/ourfutr2330/article/details/52324863

版权

该博客介绍了如何解决一个关于无向图的色数问题，使用动态规划和状态压缩的方法来求解每个非空子集的色数，并给出了一种特殊的输出答案方式。文章提供了样例输入和输出，并提到了这是状压DP的经典应用。

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

Color II
Time Limit: 2000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64u

Description
You are given an undirected graph with n vertices numbered 0 through n-1.

Obviously, the vertices have 2^n - 1 non-empty subsets. For a non-empty subset S, we define a proper coloring of S is a way to assign each vertex in S a color, so that no two vertices in S with the same color are directly connected by an edge. Assume we’ve used k different kinds of colors in a proper coloring. We define the chromatic number of subset S is the minimum possible k among all the proper colorings of S.

Now your task is to compute the chromatic number of every non-empty subset of the n vertices.

Input
First line contains an integer t. Then t testcases follow.

In each testcase: First line contains an integer n. Next n lines each contains a string consisting of ‘0’ and ‘1’. For 0<=i<=n-1 and 0<=j<=n-1, if the j-th character of the i-th line is ‘1’, then vertices i and j are directly connected by an edge, otherwise they are not directly connected.

The i-th character of the i-th line is always ‘0’. The i-th character of the j-th line is always the same as the j-th character of the i-th line.

For all testcases, 1<=n<=18. There are no more than 100 testcases with 1<=n<=10, no more than 3 testcases with 11<=n<=15, and no more than 2 testcases with 16<=n<=18.

Output
For each testcase, only print an integer as your answer in a line.

This integer is determined as follows:
We define the identity number of a subset S is id(S)=\sum_{v\in S} 2^v. Let the chromatic number of S be f_{id(S)}.