AYIT2017暑假集训第二周周三赛 G - Five-In-a-Row CodeForces - 825B

最新推荐文章于 2018-09-20 21:02:02 发布
最新推荐文章于 2018-09-20 21:02:02 发布
阅读量385 收藏
点赞数
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/wang19980123/article/details/75544697
版权

Alice and Bob play 5-in-a-row game. They have a playing field of size10 × 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'.

Example
Input 
XX.XX.....
.....OOOO.
..........
..........
..........
..........
..........
..........
..........
..........
Output 
YES
Input 
XXOXX.....
OO.O......
..........
..........
..........
..........
..........
..........
..........
..........
Output 
NO
这道题就是问x可不可以连成五个，可以输出YES，不行输出NO。写的有些长了，等过几天再写个短的
#include<stdio.h>
#include<string.h>
char map1[20][20];//存放棋盘
int main()
{
    while(~scanf("%s",map1[0]))//输入棋盘
    {
        int flag=0;
        for(int i=1; i<10; i++)
            scanf("%s",map1[i]);
        for(int i=0; i<10; i++)
        {
            for(int j=0; j<10; j++)
            {
                if(map1[i][j]=='X')//当找到棋子x时，对周围进行搜索
                {
                    int gs=1,d=0;//gs代表找到的棋子数，因为有xx.xx等这样的情况存在，所以设置一个变量，使得黑棋与黑棋之间可以隔一个
                    for(int k=j+1; k<10; k++)//发现以后向左寻找
                    {
                        if(map1[i][k]=='O')//如果遇到白棋则说明这个方向上是肯定组不成五个了所以跳出这个方向
                            break;
                        else if(map1[i][k]=='.')//如果是.则点可以把黑棋分成两半，所以用d来记录点的个数
                        {
                            d++;
                            if(d>1) break;//如果点多于一个则肯定连不上
                            gs++;//因为要在点处放旗子，所以也要记录，相当于在那里放了一个黑棋子
                        }
                       else if(map1[i][k]=='X')//找到棋子，gs++；
                            gs++;
                        if(gs==5)//当找到的棋子数为伍时，则输出yes，退出程序。
                        {
                            printf("YES\n"); flag=1; return 0;
                        }
                    }
                    gs=1,d=0;//每次寻找都把棋子数和点数重置
                    for(int k=j-1; k>=0; k--)//向右寻找
                    {
                        if(map1[i][k]=='O')
                            break;
                        else if(map1[i][k]=='.')
                        {
                            d++;
                            if(d>1)
                                break;
                            gs++;
                        }
                        else if(map1[i][k]=='X')
                            gs++;
                        if(gs==5)
                        {
                            printf("YES\n");
                            flag=1;
                            return 0;
                        }
                    }
                    gs=1,d=0;
                    for(int k=i+1; k<10; k++)//向下寻找
                    {
                        if(map1[k][j]=='O')
                            break;
                        else if(map1[k][j]=='.')
                        {
                            d++;
                            if(d>1)
                                break;
                            gs++;
                        }
                        else if(map1[k][j]=='X')
                            gs++;
                        if(gs==5)
                        {
                            printf("YES\n"); flag=1; return 0;
                        }
                    }
                    gs=1,d=0;
                    for(int k=i-1; k>=0; k--)//向上寻找
                    {
                        if(map1[k][j]=='O')
                            break;
                        else if(map1[k][j]=='.')
                        {
                            d++;
                            if(d>1)
                            {
                                break;
                            }
                            gs++;
                        }
                        else if(map1[k][j]=='X')
                            gs++;
                        if(gs==5)
                        {
                            printf("YES\n"); flag=1; return 0;
                        }
                    }
                    gs=1,d=0;
                    for(int k=j+1,q=i+1; k<10&&q<10; k++,q++)//向右下寻找
                    {
                        if(map1[q][k]=='O')
                            break;
                        else if(map1[q][k]=='.')
                        {
                            d++;
                            if(d>1)
                                break;
                            gs++;
                        }
                        else if(map1[q][k]=='X')
                            gs++;
                        if(gs==5)
                        {
                            printf("YES\n");  flag=1;return 0;
                        }
                    }
                    gs=1,d=0;
                    for(int k=j-1,q=i-1; k>=0&&q>=0; k--,q--)//向左上寻找
                    {
                        if(map1[q][k]=='O')
                            break;
                        else if(map1[q][k]=='.')
                        {
                            d++;
                            if(d>1)
                                break;
                            gs++;
                        }
                        else if(map1[q][k]=='X')
                            gs++;
                        if(gs==5)
                        {
                            printf("YES\n"); flag=1;return 0;
                        }
                    }
                    gs=1,d=0;
                    for(int k=j-1,q=i+1; k>=0&&q<10; k--,q++)//向左下寻找
                    {
                        if(map1[q][k]=='O')
                            break;
                        else if(map1[q][k]=='.')
                        {
                            d++;
                            if(d>1)
                                break;
                            gs++;
                        }
                        else if(map1[q][k]=='X')
                            gs++;
                        if(gs==5)
                        {
                            printf("YES\n"); flag=1; return 0;
                        }
                    }
                    gs=1,d=0;
                    for(int k=j+1,q=i-1; k<=10&&q>=0; k++,q--)//向右上寻找
                    {
                        if(map1[q][k]=='O')
                        {
                            break;
                        }
                        else if(map1[q][k]=='.')
                        {
                            d++;
                            if(d>1)
                                break;
                            gs++;
                        }
                        else if(map1[q][k]=='X')
                            gs++;
                        if(gs==5)
                        {
                            printf("YES\n"); flag=1;return 0;
                        }
                    }
                }
            }
        }
        if(flag==0)//若flag==0，则说明没有找到合适的地方，所以输出no
            printf("NO\n");
    }
    return 0;
}
wang19980123
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
NowCardinal.1glb30ayit.gaglUC0
03-22
【标题】"NowCardinal.1glb30ayit.gaglUC0"看起来像是一个特定项目或软件的命名约定，可能是一个程序或者数据文件的名称。然而，这个名称本身并不直接关联到任何特定的IT知识点。在IT领域中，这种格式可能是为了确保...
Educational Codeforces Round 25 B. Five-In-a-Row
twh233的算法blog
07-17 880
传送门 B. 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
Five-In-a-Row CodeForces - 825B
初吻--给了奶嘴
07-20 530
Five-In-a-Row  CodeForces - 82 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
B.Five-In-a-Row【逻辑+模拟】
王小二的博客
07-17 1033
B. 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 ha
CodeForces 825B Five-In-a-Row
UncleJokerly
07-20 333
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
G - Five-In-a-Row CodeForces - 825B
guoshuyan12的博客
07-21 241
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 th
N - Five-In-a-Row
titi2018815的博客
09-20 227
题目： 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 mat...
B. Five-In-a-Row
东方日出西边红
07-21 728
B. 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 ha
CodeForces - 825B
obsorb_knowledge的博客
07-21 818
Alice and Bob play5-in-a-row game. They have a playing field of size 10 × 10. In turns theyput either crosses or noughts, one at a time. Alice puts crosses and Bob putsnoughts. In current matchthey h
CodeForce 825B Five-In-a-Row
zitian246的博客
07-21 542
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 th
CodeForces 825B：Five-In-a-Row（模拟）
并非所有流浪者都迷失了自我
08-01 568
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.
CodeForces 825B Five-In-a-Row
weixin_30491641的博客
08-02 73
Alice and Bob play 5-in-a-row game. They have a playing field of size10 × 10. In turns they put either crosses or noughts, one at a time. Alice puts crosses and Bob puts noughts. In current match ...
CodeForces - 825B Five-In-a-Row
fff217的博客
07-21 377
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
CodeForces - 825B Five-In-a-Row （暴力模拟）
hao_994的博客
07-20 485
Five-In-a-Row  CodeForces - 825B 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
（CodeForces - 825B）Five-In-a-Row
The wind of freedom blows
08-25 306
（CodeForces - 825B）Five-In-a-Row 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 nought
G - Five-In-a-Row
林思少的博客
07-21 260
B. 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 ha
2011 ACM-ICPC 成都赛区A题 Alice and Bob （博弈动规）
狂飙的蜗牛 的专栏
05-02 1671
取石子，博弈动规

“相关推荐”对你有帮助么？

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值