HDU - 1241 POJ - 1562 Oil Deposits DFS FloodFill漫水填充法求连通块问题
2024-09-25 05:51:04
Oil Deposits
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
0
1
2
2 搜索水题。枚举每个起始点,向外扩展与他相邻的点。起始点的个数即为连通块个数。
#include<stdio.h> char a[][];
int c,n,m;
void dfs(int x,int y){
if(x<||y<||x>=n||y>=m) return;
if(a[x][y]=='*') return;
if(a[x][y]=='@'){
a[x][y]='*';
dfs(x+,y);
dfs(x+,y+);
dfs(x,y+);
dfs(x-,y+);
dfs(x-,y);
dfs(x-,y-);
dfs(x,y-);
dfs(x+,y-);
}
}
int main()
{
int i,j;
while(scanf("%d%d",&n,&m)&&!(n==&&m==)){
c=;
for(i=;i<n;i++){
getchar();
scanf("%s",a[i]);
}
for(i=;i<n;i++){
for(j=;j<m;j++){
if(a[i][j]=='@'){
c++;
dfs(i,j);
}
}
}
printf("%d\n",c);
}
return ;
}
最新文章
- sed处理文本文件
- JAVA学习博客----2015.4
- css3过渡transition
- BZOJ 1821 JSOI2010 部落划分 Group prim
- 最小生成树练习2(Kruskal)
- Java基础巩固--正则表达式
- JavaEE XML XSL转换(XSLT)
- JavaSE之认识java
- phpcms中content主要使用的详情列表关系
- Flask中&#39;endpoint&#39;(端点)的理解
- 人生苦短之我用Python篇(socket编程)
- 三、synchronized同步锁
- “Hello World!”团队第十三次会议
- linux命令之进程管理命令
- es站内站内搜索笔记(一)
- leetCode没那么难啦 in Java (一)
- Ansible学习 Patterns
- 九度OJ 1260:珍珠项链 (字符串处理、DP)
- rem适配方案
- python 写 组合两两组合