CodeForces 445A

最新推荐文章于 2024-05-02 21:17:23 发布

原创最新推荐文章于 2024-05-02 21:17:23 发布 · 818 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#codeforces #数据结构 #for循环 #算法 #比赛

2015年暑假集训周赛题目专栏收录该内容

14 篇文章

订阅专栏

本文介绍了一个棋盘布局算法，该算法确保黑白棋子相邻时颜色不同。通过将棋盘的好位置按行列的奇偶性放置黑白棋子，解决了棋盘布局问题。文中还提供了完整的C语言实现代码。

Description

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 Input

Input

1 1
.

Output

Input

2 2
..
..

Output

BW
WB

Input

3 3
.-.
---
--.

Output

B-B
---
--B

Hint

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的方法，这样就不会出现重样的
#include<stdio.h>
#include<string.h>
#define N 1010
int main()
{
  int n,m,i,j;
  char s[220][220],t[220][220];
  while(~scanf("%d%d",&n,&m))
  {
  getchar();
    for(i=0;i<=n-1;i++)
    {

      scanf("%s",s[i]);



    }
    for(i=0;i<=n-1;i++)
    {
      for(j=0;j<=m-1;j++)
      {
        if(s[i][j]=='-')
        t[i][j]='-';
        else if(i%2==0)
        {
          if(j%2==0)
          {
            t[i][j]='B';
          }
          else
          {
             t[i][j]='W';
          }

        }
        else if(i%2==1)
        {
          if(j%2==1)
          {
            t[i][j]='B';
          }
          else
          {
               t[i][j]='W';
          }

        }
      }

    }
   for(i=0;i<=n-1;i++)
   {
     for(j=0;j<=m-1;j++)
     {
       printf("%c",t[i][j]);
     }
     printf("\n");
   }
  }

   return 0;
}