Codeforces Round #254 (Div. 2):A. DZY Loves Chessboard
2015-07-19 13:38
821 查看
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.
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.
#include<cstdio> #include<cstring> #include<iostream> #include<algorithm> using namespace std; const int M = 1000 + 5; char str[M][M]; int a, b; int main() { while(scanf("%d%d", &a, &b)!=EOF) { memset(str, 0, sizeof(str)); for(int i=1; i<=a; i++) for(int j=1; j<=b; j++) cin>>str[i][j]; for(int i=1; i<=a; i++) for(int j=1; j<=b; j++) { if(str[i][j]=='.') { if((i+j)%2==0) str[i][j]='B'; else str[i][j]='W'; } } for(int i=1; i<=a; i++) { for(int j=1; j<=b; j++) cout<<str[i][j]; cout<<endl; } } return 0; }
相关文章推荐
- tableview顶部视图下拉放大
- 编程规范
- NYOJ275 队花的烦恼一
- Linux crontab命令详解与实例
- Linux统计文件个数或是代码行数
- Linux nohup命令详解
- Linux 下查看机器配置命令
- C templet and switch case with serial number
- C++学习杂笔(总)
- Python中GBK, UTF-8和Unicode的编码问题
- 进程间 对共享资源的访问 互斥 机制
- 用busybox制作文件系统
- Tomcat Server at localhost was unable to start within 45 seconds)
- 背单词App开发日记2
- Python+Selenium2自动化测试之IE、chrome浏览器启动
- C++学习笔记36 (模板的细节明确template specialization)和显式实例(template instantiation)
- 函数式编程
- uploadify使用若干问题
- Ext FormPanel布局
- swift2 方法