22356_TicTacToe

2022-5-16 18:21| 发布者: Hocassian| 查看: 19| 评论: 0|原作者: 肇庆学院ACM合集

摘要:
C:\Users\Administrator\Downloads\2019-10-12-10-14-5-89506351171499-Problem List-采集的数据-后羿采集器.html

Pro.ID

22356

Title

Tic Tac Toe

Title链接

http://10.20.2.8/oj/exercise/problem?problem_id=22356

AC

1

Submit

2

Ratio

50.00%

时间&空间限制

  • Time Limit: 300/100 MS (Java/Others)     Memory Limit: 131072/65536 K (Java/Others)
  • 描述

    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.

    输出

    Description
    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?
    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.
    Sample Input
    2
    X.O
    OO.
    XXX

    O.X
    XX.
    OOO
    Sample Output
    yes
    no
    Source

    样例输入

    2
    X.O
    OO.
    XXX

    O.X
    XX.
    OOO

    样例输出

    yes
    no

    作者


    路过

    雷人

    握手

    鲜花

    鸡蛋

    最新评论

    返回顶部