# Problem L

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

#include <stdio.h>
#include <string.h>
struct queuenode{								//建结构
int a, b;
}queue[100000];

int count, tx, ty, head = 0,tail = 0;			//定义
int a, b, n, temp;
int dir[8][2] = { {1,0} , {0,1} , {-1,0} , {0,-1} , {1,1} , {-1,-1} , {1,-1} , {-1,1} };
bool map[110][110];
int m, k, i, j;
int inarea(int x,int y)					//判断是否在区域内
{
return x >= 0 && y >= 0 && x < a && y < b;
}

void bfs(  )									//bfs
{
count++;
map[i][j] = 1;
for(k = 0;k < 8; k++){				//八个方向了～！
if(inarea(tx, ty) && map[tx][ty]== 0){
tail++;
queue[tail].a = tx;
queue[tail].b = ty;
map[tx][ty] = 1;
}
}
}
return;
}

int main(void)									//主函数
{
while(scanf("%d%d",&a,&b)==2&&a!=0){
memset(map, 1, sizeof(map));
while(scanf(" ")||scanf("\n")) ;
for(i = 0;i < a; i++){					//扫描地图
for(j = 0;j < b; j++){
scanf("%c",&temp);
if (temp == '*') map[i][j] = 1;
else if (temp == '@') map[i][j] = 0;
else {
j--;
continue;
}
}
}

count = 0;								//初始化计数
for(i = 0;i < a;i ++){
for(j = 0;j < b;j ++){
if (map[i][j] == 0){			//从找到油田开始进入bfs
bfs();
}
}
}
printf("%d\n",count);
}
return 0;
}



#### ACM油田问题

2017-06-01 14:07:29

#### 勘探油田（简单的程序设计）图的深度优先和广度优先算法（DFS递归）

2014-08-11 23:47:56

#### HDU 1241/UVa572 Oil Deposits(DFS&BFS)

2016-03-22 18:14:35

#### POJ 1606 Jugs(BFS:找最短路径并输出)

2014-05-11 21:07:21

#### POJ-3984迷宫问题(典型BFS找最短路径)

2016-12-26 20:45:59

#### 油田问题

2017-05-12 07:16:15

#### 实现DFS之“油田”

2014-04-01 22:57:59

#### 【蓝桥杯-bfs】找钥匙回家

2018-02-27 21:50:18

#### FOJ 1205 小鼠迷宫问题【BFS+dfs回溯查找路径】

2016-03-10 23:30:12

#### 油田问题（dfs）

2017-02-09 21:26:58