这是一篇关于DZY在n×m的棋盘上放置棋子的问题，棋盘中有些格子是坏的，不能放置棋子。DZY希望在所有好的格子上放置黑白棋子，条件是相同颜色的棋子不能相邻。任务是找到一种合适的放置方法。题目提供了输入格式和输出要求，并给出了一些样例解答。解决这个问题可以采用深度优先搜索（DFS）的方法，从棋盘的第一个好格子开始放置棋子。
题目链接：点击打开链接
A. DZY Loves Chessboard
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
DZY loves chessboard, and he enjoys playing with it.
He has a chessboard of n rows and m columns. Some cells of the chessboard are bad, others are good. For every good cell, DZY wants to put a chessman on it. Each chessman is either white or black. After putting all chessmen, DZY wants that no two chessmen with the same color are on two adjacent cells. Two cells are adjacent if and only if they share a common edge.
You task is to find any suitable placement of chessmen on the given chessboard.
最低0.47元/天 解锁文章
扫一扫
2万+
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
