搜索 F

Description

Technicians in a pathology lab analyze digitized images of slides. Objects on a slide are selected for analysis by a mouse click on the object. The perimeter of the boundary of an object is one useful measure. Your task is to determine this perimeter for selected objects. 

The digitized slides will be represented by a rectangular grid of periods, '.', indicating empty space, and the capital letter 'X', indicating part of an object. Simple examples are 

XX   Grid 1       .XXX   Grid 2 XX                .XXX                   .XXX                   ...X                   ..X.  X... 

An X in a grid square indicates that the entire grid square, including its boundaries, lies in some object. The X in the center of the grid below is adjacent to the X in any of the 8 positions around it. The grid squares for any two adjacent X's overlap on an edge or corner, so they are connected. 

XXX XXX    Central X and adjacent X's XXX 

An object consists of the grid squares of all X's that can be linked to one another through a sequence of adjacent X's. In Grid 1, the whole grid is filled by one object. In Grid 2 there are two objects. One object contains only the lower left grid square. The remaining X's belong to the other object. 

The technician will always click on an X, selecting the object containing that X. The coordinates of the click are recorded. Rows and columns are numbered starting from 1 in the upper left hand corner. The technician could select the object in Grid 1 by clicking on row 2 and column 2. The larger object in Grid 2 could be selected by clicking on row 2, column 3. The click could not be on row 4, column 3. 

One useful statistic is the perimeter of the object. Assume each X corresponds to a square one unit on each side. Hence the object in Grid 1 has perimeter 8 (2 on each of four sides). The perimeter for the larger object in Grid 2 is illustrated in the figure at the left. The length is 18. 

Objects will not contain any totally enclosed holes, so the leftmost grid patterns shown below could NOT appear. The variations on the right could appear: 

Impossible   Possible XXXX         XXXX   XXXX   XXXX X..X         XXXX   X...   X... XX.X         XXXX   XX.X   XX.X XXXX         XXXX   XXXX   XX.X .....        .....  .....  ..... ..X..        ..X..  ..X..  ..X.. .X.X.        .XXX.  .X...  ..... ..X..        ..X..  ..X..  ..X.. .....        .....  .....  ..... 

Input

The input will contain one or more grids. Each grid is preceded by a line containing the number of rows and columns in the grid and the row and column of the mouse click. All numbers are in the range 1-20. The rows of the grid follow, starting on the next line, consisting of '.' and 'X' characters. 

The end of the input is indicated by a line containing four zeros. The numbers on any one line are separated by blanks. The grid rows contain no blanks. 

Output

For each grid in the input, the output contains a single line with the perimeter of the specified object.

Sample Input

2 2 2 2XXXX6 4 2 3.XXX.XXX.XXX...X..X.X...5 6 1 3.XXXX.X....X..XX.X.X...X..XXX.7 7 2 6XXXXXXXXX...XXX..X..XX..X...X..X..XX.....XXXXXXXX7 7 4 4XXXXXXXXX...XXX..X..XX..X...X..X..XX.....XXXXXXXX0 0 0 0

Sample Output

81840488

             这道题基本题意为让你从所确定的点上下左右左上右上左下右下八个方向相连的区域的周长。

         这个题为一道DFS题，可以将所给区域的外层都初始化为点号，当向上下左右四个方向搜索到点号时计数器加一，即为一个边缘，当深搜结束时，输出计数器的大小即可。

源代码如下：

#include<iostream> 
#include<cstdio>  
#include<cstring>
using namespace std;  
int const MAX  = 21;  
char map[MAX][MAX];  
bool vis[MAX][MAX];  
int n, m, x, y;  
int dirx[8] = {1, -1, 0, 0, 1, -1, 1, -1};  
int diry[8] = {0, 0, 1, -1, 1, -1, -1, 1};  
int ans;  
  
int DFS(int x, int y)  
{  
    vis[x][y] = true;  
    for(int i = 0; i < 4; i++)  
        if(map[x + dirx[i]][y + diry[i]] == '.')  
            ans++;  
    for(int i = 0; i < 8; i++)  
    {  
        int xx = x + dirx[i];  
        int yy = y + diry[i];  
        if(xx <= n && xx >= 1 && yy <= m && yy >= 1 && !vis[xx][yy] && map[xx][yy] == 'X')  
            DFS(xx, yy);  
    }  
    return ans;  
}  
  
int main()  
{  
    while(scanf("%d %d %d %d", &n, &m, &x, &y) != EOF && n + m)  
    {  
        ans = 0;  
        memset(vis, false, sizeof(vis));  
        for(int i = 1; i <= n; i++)  
            scanf("%s", map[i] + 1);  
        for(int i = 0; i <= n + 1; i++)  
            map[i][0] = map[i][m + 1] = '.';  
        for(int i = 0; i <= n + 1; i++)  
            map[0][i] = map[n + 1][i] = '.';  
        DFS(x, y);  
        printf("%d\n", ans);  
    }  
}