DZY Loves Chessboard
2015-06-11 20:43
295 查看
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 white, "B" means it is black, "-"
means the cell is a bad cell.
If multiple answers exist, print any of them. It is guaranteed that at least one answer exists.
Sample test(s)
input
output
input
output
input
output
Note
In the first sample, DZY puts a single black chessman. Of course putting a white one is also OK.
In the second sample, all 4 cells are
good. No two same chessmen share an edge in the sample output.
In the third sample, no good cells are adjacent. So you can just put 3 chessmen,
no matter what their colors are.
一个棋盘,给你两个颜色,在规定区域涂色,相邻格子不可以同色。一开始用贪心,找到地方就涂B,周围可以涂的都是W,但是这会有bug,比如
.--.
....这样就会出错。所以还是应该用搜索,一直到没有联通的为止。
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 white, "B" means it is black, "-"
means the cell is a bad cell.
If multiple answers exist, print any of them. It is guaranteed that at least one answer exists.
Sample test(s)
input
1 1 .
output
B
input
2 2 .. ..
output
BW
WB
input
3 3 .-. --- --.
output
B-B---
--B
Note
In the first sample, DZY puts a single black chessman. Of course putting a white one is also OK.
In the second sample, all 4 cells are
good. No two same chessmen share an edge in the sample output.
In the third sample, no good cells are adjacent. So you can just put 3 chessmen,
no matter what their colors are.
一个棋盘,给你两个颜色,在规定区域涂色,相邻格子不可以同色。一开始用贪心,找到地方就涂B,周围可以涂的都是W,但是这会有bug,比如
.--.
....这样就会出错。所以还是应该用搜索,一直到没有联通的为止。
#include<cstdio> #include<cstring> #include<iostream> using namespace std; char c[102][102]; int leap[102][102], m, n; void bfs(int x, int y,int step) { if (x + 1 <= n&&!leap[x + 1][y] && c[x + 1][y] == '.') { if (step % 2 == 0) c[x + 1][y] = 'W'; else c[x + 1][y] = 'B'; leap[x + 1][y] = 1; bfs(x + 1, y, step + 1); } if (x - 1 >= 1 && !leap[x - 1][y] && c[x - 1][y] == '.') { if (step % 2 == 0) c[x - 1][y] = 'W'; else c[x - 1][y] = 'B'; leap[x - 1][y] = 1; bfs(x - 1, y, step + 1); } if (y + 1 <= m&&!leap[x][y + 1] && c[x][y + 1] == '.') { if (step % 2 == 0) c[x][y + 1] = 'W'; else c[x][y + 1] = 'B'; leap[x][y + 1] = 1; bfs(x, y + 1, step + 1); } if (y - 1 >= 1 && !leap[x][y - 1] && c[x][y - 1] == '.') { if (step % 2 == 0) c[x][y - 1] = 'W'; else c[x][y - 1] = 'B'; leap[x][y - 1] = 1; bfs(x, y - 1, step + 1); } } int main() { int i, j, ans; char s; cin >> n >> m; memset(leap, 0, sizeof(leap)); for (i = 1; i <= n;i++) for (j = 1; j <= m; j++) { cin >> c[i][j]; if (c[i][j] == '-') leap[i][j] = 1; } for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) { if (c[i][j]=='.') { c[i][j] = 'B'; leap[i][j] = 1; bfs(i, j,2); } } } for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) cout << c[i][j]; cout << endl; } return 0; }
相关文章推荐
- hznu 1164 Unidirectional TSP(记录状态的DP)
- 【web安全】第六弹:手工SQL注入详解
- Redis集群部署(一)
- win7及以上版本USB2.0接口小提速
- 共享内存
- pm2 安装使用
- 使用python进行图像处理的基本方法
- LeetCode 之 Compare Version Numbers — C 实现
- 压缩与归档命令
- 电缆的特性阻抗
- poj 3669 bfs
- C语言如何调用 memcpy 函数 实现内存拷贝
- HDFS-datanode数据块部分笔记
- 安全测试之一:HTTP响应头拆分/CRLF注入详解
- 鹅厂2015实习生笔试题
- Windows 7双击文件夹/分区总是新窗口打开的解决方法[转]
- POJ 2104 区间第K大值(划分树做法)
- ASP.NET使用RadioButton控件
- IP、TCP、UDP、ICMP头详解
- Ubuntu解决运行startx命令后出现登陆密码正确但无法进入桌面问题