Codeforces Round #254 (Div. 2)445A DZY Loves Chessboard(字符串处理)
2014-07-07 14:59
78 查看
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.
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.
AC代码:
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.
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.
AC代码:
#include <stdio.h> #include <string.h> //author:XXYY int main(){ int n,m,i,j; char a[110][110],b; while(~scanf("%d%d",&n,&m)){ memset(a,'-',sizeof(a)); getchar(); for(i=1;i<=n;i++){ for(j=1;j<=m;j++){ scanf("%c",&b); if(i%2&&j%2){ if(b=='.') a[i][j]='B'; } else if(i%2&&j%2==0){ if(b=='.') a[i][j]='W'; } else if(i%2==0&&j%2){ if(b=='.') a[i][j]='W'; } else if(i%2==0&&j%2==0){ if(b=='.') a[i][j]='B'; } } getchar(); } for(i=1;i<=n;i++){ for(j=1;j<=m;j++) printf("%c",a[i][j]); printf("\n"); } } return 0; }
相关文章推荐
- Codeforces Round #163 (Div. 2) / 226A Stones on the Table (字符串处理)
- Codeforces Round #186 (Div. 2) / 313B Ilya and Queries (字符串处理)
- Codeforces Round #130 (Div. 2)A Dubstep(简单字符串处理)
- Codeforces Round #373 (Div. 2) C. Efim and Strange Grade —— 贪心 + 字符串处理
- Codeforces Round #401 (Div. 2) D. Cloud of Hashtags 贪心、字符串处理
- Croc Champ 2013 - Round 2 (Div. 2 Edition)--C 字符串处理
- Codeforces#449 (Div. 2)C 字符串递归处理
- Codeforces Round #329 (Div. 2)A 字符串处理
- Codeforces Round #324 (Div. 2) C. Marina and Vasya 字符串处理
- Codeforces Round #424 (Div. 2) B. Keyboard Layouts(字符串处理)
- Codeforces Round #208 (Div. 2) Problem B Dima and Text Messages(简单字符串处理)
- 字符串处理 Codeforces Round #296 (Div. 2) B. Error Correct System
- 贪心/字符串处理 Codeforces Round #291 (Div. 2) A. Chewbaсca and Number
- Codeforces Round #256 (Div. 2/B)/Codeforces448B_Suffix Structures(字符串处理)
- Codeforces Round #338 (Div. 2) C. Running Track 字符串处理
- 字符串处理/贪心 Codeforces Round #307 (Div. 2) B. ZgukistringZ
- Codeforces Round #FF (Div. 2/B)/Codeforces447B_ DZY Loves Strings(字符串处理)
- 字符串处理 Codeforces Round #297 (Div. 2) B. Pasha and String
- Codeforces Round #375 (Div. 2) B. Text Document Analysis(字符串处理,简单题目)
- Codeforces Round #425 (Div. 2) B. Petya and Exam(字符串处理)