Codeforces Round #254 (Div. 2) A. DZY Loves Chessboard
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.
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 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.
1 1 .
B
2 2 .. ..
BW WB
3 3 .-. --- --.
B-B --- --B
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.
判定条件为(i+j)%2=0而且a [ i ] =‘ . ’ 则放B或者W(任意选优先哪个字母)
#include<bits/stdc++.h> #define maxn 105 using namespace std; int main() { int m,n,i,j; char a[maxn][maxn]; cin>>n>>m; for(i=0;i<n;i++) cin>>a[i]; for(i=0;i<n;i++) { for(j=0;j<m;j++) { if(a[i][j]!='-') { if((i+j)%2==0) a[i][j]='B'; else a[i][j]='W'; } cout<<a[i][j]; } cout<<endl; } return 0; }
版权声明:本文博客原创文章,博客,未经同意,不得转载。
相关文章
- 【Codeforces Round #696 (Div. 2) D】Cleaning
- 【Codeforces Round #694 (Div. 2) C】Strange Birthday Party
- 【Educational Codeforces Round 94 (Rated for Div. 2) B】RPG Protagonist
- 【Codeforces Round #639 (Div. 2) C】Hilbert's Hotel
- 【Codeforces Round #247 (Div. 2) C】k-Tree
- 【Codeforces Round #645 (Div. 2) A】 Park Lighting
- 【 Educational Codeforces Round 51 (Rated for Div. 2) F】The Shortest Statement
- 【Codeforces Round #507 (Div. 2, based on Olympiad of Metropolises) B】Shashlik Cooking
- 【Codeforces Round #507 (Div. 2, based on Olympiad of Metropolises) A】Palindrome Dance
- 【Codeforces Round #476 (Div. 2) [Thanks, Telegram!] B】Battleship
- 【ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined) B】Recursive Queries
- 【Codeforces Round #455 (Div. 2) C】 Python Indentation
- 【Codeforces Round #453 (Div. 2) C】 Hashing Trees
- 【Codeforces Round #445 (Div. 2) D】Restoration of string
- 【Codeforces Round #432 (Div. 2) B】Arpa and an exam about geometry
- 【Codeforces Round #425 (Div. 2) A】Sasha and Sticks
- 【Codeforces Round #424 (Div. 2) C】Jury Marks
- Codeforces Round #256 (Div. 2) B. Suffix Structures
- Codeforces Round #250 (Div. 2)—A. The Child and Homework
- Codeforces Round #274 (Div. 2)
- Codeforces Round #274 (Div. 2)
- Codeforces Round #246 (Div. 2)
- ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)
- Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)
- Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)
- Codeforces Round #411 (Div. 2)
- VP记录:Codeforces Round 857 (Div. 2) A~D