首页 / GO / 2015南阳CCPC G - Ancient Go 暴力

2015南阳CCPC G - Ancient Go 暴力

内容导读

互联网集市收集整理的这篇技术教程文章主要介绍了2015南阳CCPC G - Ancient Go 暴力，小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含3486字，纯文字阅读大概需要5分钟。

内容图文

G - Ancient Go

Time Limit: 1 Sec  

Memory Limit: 256 MB

题目连接

无

Description


Yu Zhou likes to play Go with Su Lu. From the historical research, we found that there are much difference on the rules between ancient go and modern go.
Here is the rules for ancient go they were playing:
    The game is played on a 8×8 cell board, the chess can be put on the intersection of the board lines, so there are 9×9 different positions to put the chess.
    Yu Zhou always takes the black and Su Lu the white. They put the chess onto the game board alternately.
    The chess of the same color makes connected components(connected by the board lines), for each of the components, if it‘s not connected with any of the empty cells, this component dies and will be removed from the game board.
    When one of the player makes his move, check the opponent‘s components first. After removing the dead opponent‘s components, check with the player‘s components and remove the dead components.
One day, Yu Zhou was playing ancient go with Su Lu at home. It‘s Yu Zhou‘s move now. But they had to go for an emergency military action. Little Qiao looked at the game board and would like to know whether Yu Zhou has a move to kill at least one of Su Lu‘s chess.

Input

The first line of the input gives the number of test cases, T(1≤T≤100). T test cases follow. Test cases are separated by an empty line. Each test case consist of 9 lines represent the game board. Each line consists of 9 characters. Each character represents a cell on the game board. . represents an empty cell. x represents a cell with black chess which owned by Yu Zhou. o represents a cell with white chess which owned by Su Lu.

Output

For each test case, output one line containing Case #x: y, where x is the test case number (starting from 1) and y is Can kill in one move!!! if Yu Zhou has a move to kill at least one of Su Lu‘s components. Can not kill in one move!!! otherwise.

Sample Input

2
.......xo
.........
.........
..x......
.xox....x
.o.o...xo
..o......
.....xxxo
....xooo.
......ox.
.......o.
...o.....
..o.o....
...o.....
.........
.......o.
...x.....
........o

Sample Output

Case #1: Can kill in one move!!!
Case #2: Can not kill in one move!!!

HINT

 

题意

下围棋，让你下一粒子，然后问你能否至少围住一个o

题解：

数据范围才9*9，直接瞎暴力就行了

代码：

#include<stdio.h>
#include<iostream>
#include<math.h>
#include<cstring>
usingnamespace std;

string s[10];
int vis[10][10];
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
int check2(int x,int y)
{
    vis[x][y]=1;
    if(x<0||x>=9||y<0||y>=9)return0;
    for(int i=0;i<4;i++)
    {
        int xx = x+dx[i];
        int yy = y+dy[i];
        if(xx<0||xx>=9||yy<0||yy>=9)continue;
        if(vis[xx][yy])continue;
        if(s[xx][yy]==‘.‘)return1;
        if(s[xx][yy]==‘o‘&&check2(xx,yy))
            return1;
    }
    return0;
}
int check(int x,int y)
{
    if(s[x][y]!=‘.‘)return0;
    s[x][y]=‘x‘;
    for(int i=0;i<4;i++)
    {
        int xx = x+dx[i];
        int yy = y+dy[i];
        if(xx<0||xx>=9||yy<0||yy>=9)continue;
        if(s[xx][yy]==‘o‘)
        {
            memset(vis,0,sizeof(vis));
            if(!check2(xx,yy))
                return1;
        }
    }
    s[x][y]=‘.‘;
    return0;
}
int main()
{
    int t;scanf("%d",&t);
    for(int cas=1;cas<=t;cas++)
    {
        for(int i=0;i<9;i++)
            cin>>s[i];
        int flag = 0;
        for(int i=0;i<9;i++)
        {
            for(int j=0;j<9;j++)
            {
                if(s[i][j]==‘o‘||s[i][j]==‘x‘)continue;
                if(check(i,j))
                {
                    flag = 1;
                    s[i][j]=‘.‘;
                    break;
                }
            }
        }
        if(flag)
            printf("Case #%d: Can kill in one move!!!\n",cas);
        else
            printf("Case #%d: Can not kill in one move!!!\n",cas);
    }
}

 

原文：http://www.cnblogs.com/qscqesze/p/4899353.html

内容总结

以上是互联网集市为您收集整理的2015南阳CCPC G - Ancient Go 暴力全部内容，希望文章能够帮你解决2015南阳CCPC G - Ancient Go 暴力所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。

内容备注

版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 gblab@vip.qq.com 举报，一经查实，本站将立刻删除。

内容手机端

扫描二维码推送至手机访问。

本文链接：https://qyyshop.com/info/1281317.html

来源：【匿名】