HDOJ - 1241 Oil Deposits

最新推荐文章于 2020-03-15 19:07:38 发布

ah_yeah

最新推荐文章于 2020-03-15 19:07:38 发布

阅读量262

点赞数

分类专栏： DFS

本文链接：https://blog.csdn.net/ah_yeah/article/details/52059370

版权

DFS 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

Oil Deposits

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

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

题目不是太难，与red and black那题类似，不过把坐标变换数组扩大到8个元素，详情参考：点击打开链接。不过还是有许多的小细节要注意的！废话不多说，看代码！

#include<cstdio>  
#include<cstring>  
#include<algorithm>  
using namespace std;  
int m,n,ans,a,b,sum;  
char map[110][110]; 
int px[8]={-1,0,1,0,-1,-1,1,1};   
int py[8]={0,1,0,-1,-1,1,-1,1};//对应八个方位 
void dfs(int a,int b){  
    for(int i=0;i<8;i++){  
        int x=a+px[i];  
        int y=b+py[i]; 
        if(map[x][y]=='@'){
        	map[x][y]='*';//把遍历过的淘汰掉！！ 
            dfs(x,y); 
        }  
    } 
}  
int main(){  
    while(scanf("%d%d",&m,&n),m||n){
        memset(map,'*',sizeof(map)); 
    	ans=0;       
        for(int i=1;i<=m;i++){
            scanf("%s",&map[i]);
        }
        for(int i=1;i<=m;i++){
        	for(int j=0;j<=n;j++){
        		if(map[i][j]=='@'){
        			ans++;//符合条件就加1 
        			dfs(i,j);
				}
			}
		}
        printf("%d\n",ans);  
    }  
    return 0;  
}