搜索练习题F-06

 
 

  
  
   
   

    
    

     
     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 2
XX
XX
6 4 2 3
.XXX
.XXX
.XXX
...X
..X.
X...
5 6 1 3
.XXXX.
X....X
..XX.X
.X...X
..XXX.
7 7 2 6
XXXXXXX
XX...XX
X..X..X
X..X...
X..X..X
X.....X
XXXXXXX
7 7 4 4
XXXXXXX
XX...XX
X..X..X
X..X...
X..X..X
X.....X
XXXXXXX
0 0 0 0
  
  
 
 
 
 

  
  
Sample Output
  
  

   
   
8
18
40
48
8
  
  
 
 
题意：

   输入一组字符，有X有“.”，计算有连接的X得边长，（连接就是X得八个方向上有X）如样例一，四个X周围边长组起来何和为8。

思路：

    这道题我是用深搜做的，无非八个方向，用选择是X而且没访问过的搜下去，还要对本X的八个方向判断计算外边长总合

    细节看代码吧。

#include<stdio.h>
#include<queue>
#include<string.h>
#include<iostream>
using namespace std;
int m,n,dir[8][2]={{1,0},{-1,0},{0,1},{0,-1},{1,1},{-1,1},{-1,-1},{1,-1}};//八个方向
char map[30][30];
int dfs(int x,int y)
{
    if(map[x][y]=='o'||map[x][y]=='.') return 0;//访问过或不是X
    map[x][y]='o';//标记访问了
    int sum=0;
    for(int i=0;i<4;i++)
    {
        if(map[x+dir[i][0]][y+dir[i][1]]=='.')//计算周长
        {
            sum=sum+1;
        }
    }
    for(int i=0;i<8;i++)
    {
        sum=sum+dfs(x+dir[i][0],y+dir[i][1]);//八个方向搜下去
    }
    return sum;
}
int main()
{
    int a,b;
    while(cin>>m>>n>>a>>b)
    {
        if(!m&&!n&&!a&&!b) break;
        memset(map,'.',sizeof(map));
        for(int i=1;i<=m;i++)
        {
            for(int j=1;j<=n;j++)
            {
                cin>>map[i][j];
            }
        }
        cout<<dfs(a,b)<<endl;//（a,b）是搜索的开始位置
    }
}