zoukankan      html  css  js  c++  java
  • Codeforces 445A. 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.

    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.

    光考虑dfs去了石乐志。其实就是按对角线摆放即可,被bad cell迷惑到了

    #include <cstdio>
    #include <cctype>
    #include <stdlib.h>
    #include <iostream>
    #include <cmath>
    #include <iomanip>
    #include <cstring>
    #include <algorithm>
    #include <string>
    #include <vector>
    #include <map>
    
    using namespace std;
    typedef long long LL;
    
    char board[105][105];
    int n,m;
    int main()
    {
      // freopen("test.in","r",stdin);
      cin >> n >> m;
      memset(board,0,sizeof(board));
      for (int i=1;i<=n;i++){
        char s[105];
        cin >> s;
        for (int j=1;j<=m;j++){
          board[i][j] = s[j-1];
          if (board[i][j] != '-'){
            if ((i+j) & 1){
              board[i][j] = 'B';
            }
            else {
              board[i][j] = 'W';
            }
          }
        }
      }
      for (int i=1;i<=n;i++){
        for (int j=1;j<=m;j++){
          cout << board[i][j];
        }
        cout << endl;
      }
    }
    View Code
  • 相关阅读:
    Pandas高级教程之:category数据类型
    Pandas高级教程之:处理缺失数据
    Pandas高级教程之:处理text数据
    密码学系列之:blowfish对称密钥分组算法
    架构之:数据流架构
    ES6中的新特性:Iterables和iterators
    密码学系列之:feistel cipher
    Pandas高级教程之:Dataframe的重排和旋转
    Electron实用技巧-electron-builder中用户协议(license)的使用及多语言支持
    Electron实用技巧-开机启动时隐藏主窗口,只显示系统托盘
  • 原文地址:https://www.cnblogs.com/ToTOrz/p/6873421.html
Copyright © 2011-2022 走看看