301381: CF259A. Little Elephant and Chess

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Little Elephant and Chess

题意翻译

有一个$8\times 8$的棋盘,你可以对每一行进行整行移动(如果是右移的话,就等同于把最后一个字符移到最前面,其他顺次右移)。如果能够将所给棋盘转换为符合条件的棋盘就输出$YES$,否则输出$NO$(符合条件的棋盘的定义:棋盘任何一格的上下左右的颜色与这一格颜色均不同)。

题目描述

The Little Elephant loves chess very much. One day the Little Elephant and his friend decided to play chess. They've got the chess pieces but the board is a problem. They've got an $ 8×8 $ checkered board, each square is painted either black or white. The Little Elephant and his friend know that a proper chessboard doesn't have any side-adjacent cells with the same color and the upper left cell is white. To play chess, they want to make the board they have a proper chessboard. For that the friends can choose any row of the board and cyclically shift the cells of the chosen row, that is, put the last (rightmost) square on the first place in the row and shift the others one position to the right. You can run the described operation multiple times (or not run it at all). For example, if the first line of the board looks like that "BBBBBBWW" (the white cells of the line are marked with character "W", the black cells are marked with character "B"), then after one cyclic shift it will look like that "WBBBBBBW". Help the Little Elephant and his friend to find out whether they can use any number of the described operations to turn the board they have into a proper chessboard.

输入输出格式

输入格式


The input consists of exactly eight lines. Each line contains exactly eight characters "W" or "B" without any spaces: the $ j $ -th character in the $ i $ -th line stands for the color of the $ j $ -th cell of the $ i $ -th row of the elephants' board. Character "W" stands for the white color, character "B" stands for the black color. Consider the rows of the board numbered from 1 to 8 from top to bottom, and the columns — from 1 to 8 from left to right. The given board can initially be a proper chessboard.

输出格式


In a single line print "YES" (without the quotes), if we can make the board a proper chessboard and "NO" (without the quotes) otherwise.

输入输出样例

输入样例 #1

WBWBWBWB
BWBWBWBW
BWBWBWBW
BWBWBWBW
WBWBWBWB
WBWBWBWB
BWBWBWBW
WBWBWBWB

输出样例 #1

YES

输入样例 #2

WBWBWBWB
WBWBWBWB
BBWBWWWB
BWBWBWBW
BWBWBWBW
BWBWBWWW
BWBWBWBW
BWBWBWBW

输出样例 #2

NO

说明

In the first sample you should shift the following lines one position to the right: the 3-rd, the 6-th, the 7-th and the 8-th. In the second sample there is no way you can achieve the goal.

Input

题意翻译

有一个$8\times 8$的棋盘,你可以对每一行进行整行移动(如果是右移的话,就等同于把最后一个字符移到最前面,其他顺次右移)。如果能够将所给棋盘转换为符合条件的棋盘就输出$YES$,否则输出$NO$(符合条件的棋盘的定义:棋盘任何一格的上下左右的颜色与这一格颜色均不同)。

加入题单

算法标签: