（hdu）5546 Ancient Go

Problem 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

In the first test case, Yu Zhou has 4 different ways to kill Su Lu‘s component.

In the second test case, there is no way to kill Su Lu‘s component.
 

题意 在.出放一个黑棋X能包围白棋o，只能放一个黑棋

方法 搜索白棋四周有几个空白点如果小于等于1就可以

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
using namespace std;
#define N 200
#define met(a,b) memset(a,b,sizeof(a));
vector<vector<int> >Q;
char str[N][N];
int dis[4][2]= {{0,1},{1,0},{-1,0},{0,-1}};
int vis[N][N];
int pan(int x,int y)
{
    return (x>=0 && x<9 && y>=0 && y<9);
}
int dfs(int x,int y)
{
    vis[x][y]=1;int f=0;
    for(int i=0; i<4; i++)
    {
        int xx = x+dis[i][0];
        int yy = y+dis[i][1];
        if(vis[xx][yy] || !pan(xx,yy))///搜过的和坐垫不符合的跳过
            continue;
        if(str[xx][yy]==‘.‘)///有一个累加
        {
            f++;
            vis[xx][yy]=1;
        }
        if(str[xx][yy]==‘o‘)///四周白棋的四周的空白点个数
            f+=dfs(xx,yy);
    }
    return f;
}
int sove()
{
    for(int i=0; i<9; i++)
    {
        for(int j=0; j<9; j++)
        {
            if(str[i][j]==‘o‘) ///找到一个白棋搜索
            {
                met(vis,0);
                int ans=dfs(i,j);
                if(ans<=1)
                 return 1;
            }
        }
    }
    return 0;
}
int main()
{
    int t,con=1;
    scanf("%d",&t);
    while(t--)
    {
        for(int i=0; i<9; i++)
            scanf("%s",str[i]);

        int ans=sove();
        if(ans)
            printf("Case #%d: Can kill in one move!!!\n",con++);
        else
            printf("Case #%d: Can not kill in one move!!!\n",con++);
    }
    return 0;
}