LightOJ 1092 Lighted Panels 状压DP

最新推荐文章于 2021-06-08 20:40:17 发布

Firstdeep

最新推荐文章于 2021-06-08 20:40:17 发布

阅读量681

点赞数

分类专栏：状压DP

本文链接：https://blog.csdn.net/qq_21048401/article/details/52348249

版权

这道题目要求在一个RxC的矩阵中，通过最少的触摸次数将所有灯点亮。每次触摸会改变自身及周围8个相邻单元格的状态。给定初始矩阵，需要求解达到所有灯亮起的最小操作数。对于无法达成的情况，输出"impossible"。样例给出了不同情况下的输入和输出。解决方案是使用状态压缩动态规划，将矩阵行转换为10进制数，然后通过枚举操作和状态来找到最小操作数。

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

Description

You are given an R x C 2D grid consisting of several light panels. Each cell contains either a '*' or a '.'. '*' means the panel is on, and '.' means it's off. If you touch a panel, its state will be toggled. That means, if you touch a panel that's on, it will turn off, and if you touch a panel that's off, it will turn on. But if we touch a panel, all its horizontal, vertical, and diagonal adjacent panels will also toggle their states.

Now you are given the configuration of the grid. Your goal is to turn on all the lights. Print the minimum number of touches required to achieve this goal.

Input

Input starts with an integer T (≤ 125), denoting the number of test cases.

Each test case starts with two integers R (1 ≤ R ≤ 8) and C (1 ≤ C ≤ 8). Then there will be R lines each containing C characters ('*' or '.').