[kuangbin带你飞]专题一 简单搜索 L - Oil Deposits HDU1241

L - Oil Deposits

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  HDU 1241

Appoint description:  prayerhgq  (2015-07-20)System Crawler  (2015-11-06)

Description

The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. 

GeoSurvComp works with one large rectangular region of land at a time, and creates a grid that 

divides the land into numerous square plots. It then analyzes each plot separately, using sensing 

equipment to determine whether or not the plot contains oil. A plot containing oil is called a pocket. 

If two pockets are adjacent, then they are part of the same oil deposit. Oil deposits can be quite large 

and may contain numerous pockets. Your job is to determine how many different oil deposits 

are contained in a grid. 

 

Input

The input file contains one or more grids. Each grid begins with a line containing m and n, the number

 of rows and columns in the grid, separated by a single space. If m = 0 it signals the end of the input;

 otherwise 1 <= m <= 100 and 1 <= n <= 100. Following this are m lines of n characters each (not 

counting the end-of-line characters). Each character corresponds to one plot, and is either `*', 

representing the absence of oil, or `@', representing an oil pocket. 

 

Output

For each grid, output the number of distinct oil deposits. Two different pockets are part of the 

same oil deposit if they are adjacent horizontally, vertically, or diagonally. An oil deposit will 

not contain more than 100 pockets. 

 

Sample Input

     
     

      
      1 1
*
3 5
*@*@*
**@**
*@*@*
1 8
@@****@*
5 5 
****@
*@@*@
*@**@
@@@*@
@@**@
0 0 
     
     

 

Sample Output

     
     

      
      0
1
2
2 
     
     

题意 @表示油田问有几块油田，相邻的8个方向有油田就是相连一块

简单DFS

#include
   
   
    
    
#include
    
    
     
     
#include
     
     
      
      
#include
      
      
       
       
#include
       
       
         using namespace std; const int N=105; char a[N][N]; int flag,n,m; int x[]= {1,0,-1,0,1,-1,-1,1}; int y[]= {0,1,0,-1,1,-1,1,-1}; void dfs(int i,int j) { int xx,yy,k; for(k=0; k<8; k++) { xx=i+x[k]; yy=j+y[k]; if(xx>=0&&xx 
        
          =0&&yy