（CodeForces - 825B）Five-In-a-Row

（CodeForces - 825B）Five-In-a-Row

time limit per test:1 second

memory limit per test:256 megabytes

input:standard input

output:standard output

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

题目大意：一个10*10的五子棋棋盘，问x再下一颗子能不能赢。

思路：对于数据量如此小的题目，直接暴力搜索就可以了，对于每一个空白的地方下一颗x，看看能不能赢即可。

#include<cstdio>
using namespace std;

char a[15][15];

bool dfs(int x,int y)
{
    int cnt=0;
    int i,j;
    for(i=x,j=y-1;j>=0;j--)
    {
        if(a[i][j]!='X') break;
        else cnt++;
    }
    for(i=x,j=y+1;j<10;j++)
    {
        if(a[i][j]!='X') break;
        else cnt++;
    }
    if(cnt>=4) return true;
    cnt=0;
    for(i=x+1,j=y;i<10;i++)
    {
        if(a[i][j]!='X') break;
        else cnt++;
    }
    for(int i=x-1,j=y;i>=0;i--)
    {
        if(a[i][j]!='X') break;
        else cnt++;
    }
    if(cnt>=4) return true;
    cnt=0;
    for(j=y,i=x-1;i>=0;i--)
    {
        j--;
        if(j<0) break;
        if(a[i][j]!='X') break;
        else cnt++;
    }
    for(j=y,i=x+1;i<10;i++)
    {
        j++;
        if(j>=10) break;
        if(a[i][j]!='X') break;
        else cnt++;
    }
    if(cnt>=4) return true;
    cnt=0;
    for(j=y,i=x-1;i>=0;i--)
    {
        j++;
        if(j>=10) break;
        if(a[i][j]!='X') break;
        else cnt++;
    }
    for(j=y,i=x+1;i<10;i++)
    {
        j--;
        if(j<0) break;
        if(a[i][j]!='X') break;
        else cnt++;
    }
    if(cnt>=4) return true;
    cnt=0;
    return false;
}

int main()
{
    while(scanf("%s",a[0])!=EOF)
    {
        for(int i=1;i<10;i++) scanf("%s",a[i]);
        int flag;
        for(int i=0;i<10;i++)
        {
            for(int j=0;j<10;j++)
            {
                if(a[i][j]=='.')
                {
                    flag=dfs(i,j);
                    if(flag) break;
                }
            }
            if(flag) break;
        }
        if(flag) printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}