문제1149--Tic Tac Toe

1149: Tic Tac Toe

실행시간 제한: 1 Sec  메모리사용 제한: 128 MB
제출: 110  통과: 19
[제출] [채점기록] [묻고답하기]

문제 설명

Tic Tac Toe is a child's game played on a 3 by 3 grid. One player, X, starts by placing an X at an unoccupied grid position. Then the other player, O, places an O at an unoccupied grid position. Play alternates between X and O until the grid is filled or one player's symbols occupy an entire line (vertical, horizontal, or diagonal) in the grid. 
We will denote the initial empty Tic Tac Toe grid with nine dots. Whenever X or O plays we fill in an X or an O in the appropriate position. The example below illustrates each grid configuration from the beginning to the end of a game in which X wins. 

 

...  X..  X.O  X.O  X.O  X.O  X.O  X.O
...  ...  ...  ...  .O.  .O.  OO.  OO.
...  ...  ...  ..X  ..X  X.X  X.X  XXX

 

Your job is to read a grid and to determine whether or not it could possibly be part of a valid Tic  Tac Toe game. That is, is there a series of plays that can yield this grid somewhere between the start and end of the game? 

 

입력 설명

The first line of input contains N, the number of test cases. 4N-1 lines follow, specifying N grid configurations separated by empty lines. 

 

출력 설명

For each case print "yes" or "no" on a line by itself, indicating whether or not the configuration could be part of a Tic Tac Toe game. 

 

 

입력 예시 Copy

2
X.O
OO.
XXX

O.X
XX.
OOO

출력 예시 Copy

yes
no

출처/분류