poj1562

最新推荐文章于 2019-08-10 11:58:33 发布

haoli001

最新推荐文章于 2019-08-10 11:58:33 发布

阅读量319

点赞数

分类专栏： DB搜索文章标签： poj dfs c++

本文链接：https://blog.csdn.net/haoli001/article/details/38347105

版权

DB搜索专栏收录该内容

18 篇文章 0 订阅

订阅专栏

今天是七夕节，选在今天开通博客就是为了找点事忙起来这样可以忽略没有妹子的忧伤～～orz。。。。。

Oil Deposits

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 12434		Accepted: 6762

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 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

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

Source

Mid-Central USA 1997

题目大意就是找出连在一起的@。很容易想到用dfs。这里想到一个小技巧用num去覆盖map的位置，这样只要map[i][j]<=num就说明已经搜索到头了。

以下是代码。

#include 
   
   
    
    
#include 
    
    
     
     
#include 
     
     
      
      
using namespace std;
const int Len=105;
const int Max=0x3ffffff;
int map[Len][Len];
int bx[]={1,1,1,0,-1,-1,-1,0};
int by[]={1,0,-1,-1,-1,0,1,1};
int n,m;
void dfs(int x,int y,int num){
	if(x<0||x>=m||y<0||y>=n)
		      return;
	if(map[y][x]<=num)
		      return;
	map[y][x]=num;
	for(int i=0;i<8;i++){
		int xx=x+bx[i];
		int yy=y+by[i];
		dfs(xx,yy,num);
	}
}
int main(){
	while(cin>>n>>m&&(n||m)){
		for(int i=0;i
      
      
       
       >c;
			      map[i][j]=(c=='@'?Max:0);
		      }
		int num=0;
		for(int i=0;i