TOE1 - Tic-Tac-Toe ( I )
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.
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?
Input
The first line of input contains N, the number of test cases. 4N-1 lines follow, specifying N grid configurations separated by empty lines.
Output
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.
Example
Input: 2 X.O OO. XXX O.X XX. OOO Output: yes no
hide comments
cracked:
2015-04-29 18:23:19
Some test cases:
|
|
ankush sharma:
2015-04-14 15:44:48
X can win twice, be careful...... |
|
Shrikant:
2015-01-18 17:00:52
xx.
|
|
agaurav77:
2014-12-26 18:20:27
Cool question. Sometimes you have to think critically. In terms of x-wins and o-wins, anyone getting a WA due to considering 3 cases of x-wins and o-wins, here's a hint : there's a fourth case. AC :) |
|
Anubhav Balodhi :
2014-10-01 16:05:05
AC in the 3rd attempt. it's simply TicTacToe ^_^
|
|
californiagurl:
2014-07-29 16:35:16
is this valid?
|
|
Archit Jain:
2014-07-23 15:21:46
nice question
|
|
banzhuan:
2014-06-23 11:09:10
...
|
|
`Ak:
2014-06-04 08:51:49
got wa due to silly mistake
|
|
Manish Jindal:
2014-05-22 00:53:28
was getting wrong ans with gets.. but with scanf got AC.. :) 50th it is..:) |
Added by: | Camilo Andrés Varela León |
Date: | 2006-12-14 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ERL JS-RHINO NODEJS PERL6 VB.NET |
Resource: | Waterloo local 2002.09.21 |