CodeForces - 825B Five-In-a-Row

辈儿儿

于 2017-07-20 19:58:01 发布

阅读量242

点赞数

本文链接：https://blog.csdn.net/ling_bei/article/details/75577015

版权

Alice and Bob play 5-in-a-row game. They have a playing field of size 10 × 10. In turns they put either crosses or noughts, one at a time. Alice puts crosses and Bob puts noughts.

In current match they have made some turns and now it's Alice's turn. She wonders if she can put cross in such empty cell that she wins immediately.

Alice wins if some crosses in the field form line of length not smaller than 5. This line can be horizontal, vertical and diagonal.

Input

You are given matrix 10 × 10 (10 lines of 10 characters each) with capital Latin letters 'X' being a cross, letters 'O' being a nought and '.' being an empty cell. The number of 'X' cells is equal to the number of 'O' cells and there is at least one of each type. There is at least one empty cell.

It is guaranteed that in the current arrangement nobody has still won.

Output

Print 'YES' if it's possible for Alice to win in one turn by putting cross in some empty cell. Otherwise print 'NO'.

        Examples 
      

          input 
        
XX.XX.....
.....OOOO.
..........
..........
..........
..........
..........
..........
..........
..........

          output 
        
YES

          input 
        
XXOXX.....
OO.O......
..........
..........
..........
..........
..........
..........
..........
..........

          output 
        
NO
 
         
 
        

题意： X为棋子，能在横纵或斜线或对角线上有五个X，.为可以放棋子的地方，O不能放置。能连成五子，输出YES，否则输出NO。

思路：对放置有x的地方进行上·下·左·右·左上·左下·右上·右下搜索。

分为四次，横向，纵向，左斜对角线，右斜对角线

#include<stdio.h>
char map[12][12];
int main()
{
    int i,j,k,q;
    for(i=0; i<10; i++)
        scanf("%s",map[i]);
    for(i=0; i<10; i++)
        for(j=0; j<10; j++)
        {
            if(map[i][j]=='.')
            {
                int s=1;          //下面两个for循环代表竖着的方向寻找五子棋
                for(int k=j+1; k<10; k++)//向下搜索
                {
                    if(map[i][k]=='X')
                    {
                        s++;
                        if(s==5)
                        {
                            printf("YES\n");
                            return 0;
                        }
                    }
                    else break;
                }
                for(int k=j-1; k>=0; k--)  //向上搜索
                {
                    if(map[i][k]=='X')
                    {
                        s++;
                        if(s==5)
                        {
                            printf("YES\n");
                            return 0;
                        }
                    }
                    else break;
                }
                s=1;              //下面两个for循环代表横着的方向寻找五子棋
                for(int k=i+1; k<10; k++)   //向右搜索
                {
                    if(map[k][j]=='X')
                    {
                        s++;
                        if(s==5)
                        {
                            printf("YES\n");
                            return 0;
                        }
                    }
                    else break;
                }
                for(int k=i-1; k>=0; k--)  //向左搜索
                {
                    if(map[k][j]=='X')
                    {
                        s++;
                        if(s==5)
                        {
                            printf("YES\n");
                            return 0;
                        }
                    }
                    else break;
                }
                s=1;              //下面两个for循环代表\（对角线）的方向寻找五子棋
                for(k=i-1,q=j-1; q>=0,k>=0; q--,k--) //向左上搜索
                {
                    if(map[k][q]=='X')
                    {
                        s++;
                        if(s==5)
                        {
                            printf("YES\n");
                            return 0;
                        }
                    }
                    else break;
                }
                for(k=i+1,q=j+1; q<10,k<10; q++,k++)//向右下搜索
                {
                    if(map[k][q]=='X')
                    {
                        s++;
                        if(s==5)
                        {
                            printf("YES\n");
                            return 0;
                        }
                    }
                    else break;
                }
                s=1;         //下面两个for循环代表/（对角线）的方向寻找五子棋
                for(k=i+1,q=j-1; q>=0,k<10; q--,k++) //向右上搜索
                {
                    if(map[k][q]=='X')
                    {
                        s++;
                        if(s==5)
                        {
                            printf("YES\n");
                            return 0;
                        }
                    }
                    else break;
                }
                for(k=i-1,q=j+1; q<10,k>=0; q++,k--)//向左下搜索
                {
                    if(map[k][q]=='X')
                    {
                        s++;
                        if(s==5)
                        {
                            printf("YES\n");
                            return 0;
                        }
                    }
                    else break;
                }
            }
        }
    printf("NO\n");
    return 0;
}