CodeForces

先上题目：

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

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.

　　太久没敲题目，码个水题都卡了半天= =，题意：在给定的棋盘上面着色(两种颜色)，要求相邻的两个不准有同一种颜色，同时还有一些格用不了。因为这一题的解有多个，最简单的办法就是先按照黑白相间的方式把格子都涂好色，然后把需要空出来的地方都空出来就可以了。

上代码：

 1 #include <bits/stdc++.h>
 2 #define MAX 102
 3 using namespace std;
 4 
 5 char s[MAX][MAX];
 6 char c[MAX][MAX];
 7 int n,m;
 8 
 9 int main()
10 {
11     //ios::sync_with_stdio(false);
12     //freopen("data.txt","r",stdin);
13     while(cin>>n>>m){
14         memset(c,0,sizeof(c));
15         for(int i=0;i<n;i++) cin>>s[i];
16         for(int i=0;i<n;i++) for(int j=0;j<m;j++){
17             if(s[i][j]=='-') c[i][j]='-';
18             else{
19                 if((i+j)%2==1) c[i][j]='W';
20                 else c[i][j]='B';
21             }
22         }
23         for(int i=0;i<n;i++) cout<<c[i]<<endl;
24     }
25     return 0;
26 }

445A