Oil Deposits

Oil Deposits

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 8651    Accepted Submission(s): 5064

Problem 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

  
  

 

 

用dfs 遍历所有方格，题目说 只要周围一个方格有油井  就可以认定是一片油田。典型的dfs 嘛，遍历过的  包括 dfs的   之后都把@变为*    就可以了

 

#include<iostream>
using namespace std;
char str[101][101];
int m,n,ccount;
int dir[8][2]={1,1,1,0,1,-1,0,1,0,-1,-1,1,-1,0,-1,-1};
void dfs(int a,int b)
{
	if(a>=0 &&  a<m &&  b>=0 && b<n && str[a][b]=='@')
	{
		str[a][b]='*';
		for(int i=0;i<8;i++)
			dfs(a+dir[i][0],b+dir[i][1]);
	}

}
int main()
{
	int i,j;
	while(cin>>m>>n && (m || n)){//m行 n列
		ccount=0;
		for(i=0;i<m;i++){
			for(j=0;j<n;j++){
				cin>>str[i][j];
			}
		}
		for(i=0;i<m;i++){
			for(j=0;j<n;j++){
				if(str[i][j]=='@'){		
					ccount++;
					dfs(i,j);
				}
			}
		}
		cout<<ccount<<endl;
	}
	return 0;
}