CodeForces445A DZY Loves Chessboard

最新推荐文章于 2022-01-30 13:15:32 发布

weixin_33937778

最新推荐文章于 2022-01-30 13:15:32 发布

阅读量2.3w

点赞数

文章标签： json

原文链接：http://www.cnblogs.com/ya-cpp/p/4340428.html

版权

本文讲述了DZY喜欢在棋盘上下棋，他有一个n行m列的棋盘，部分格子是好的，可以放置黑白棋子。DZY希望在所有好的格子上放棋子，且相同颜色的棋子不能相邻。你需要找到一种合适的摆放方式。题目提供了一组输入数据，并要求输出满足条件的棋子摆放方案。当没有两个相同颜色的棋子相邻时，存在至少一种解决方案。

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

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.

Input

The first line contains two space-separated integers n and m (1 ≤ n, m ≤ 100).

Each of the next n lines contains a string of m characters: the j-th character of the i-th string is either "." or "-". A "." means that the corresponding cell (in the i-th row and the j-th column) is good, while a "-" means it is bad.

Output

Output must contain n lines, each line must contain a string of m characters. The j-th character of the i-th string should be either "W", "B" or "-". Character "W" means the chessman on the cell is whi