2952 Counting Sheep【dfs】

Counting Sheep

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 2609    Accepted Submission(s): 1725

Problem Description

A while ago I had trouble sleeping. I used to lie awake, staring at the ceiling, for hours and hours. Then one day my grandmother suggested I tried counting sheep after I'd gone to bed. As always when my grandmother suggests things, I decided to try it out. The only problem was, there were no sheep around to be counted when I went to bed.


Creative as I am, that wasn't going to stop me. I sat down and wrote a computer program that made a grid of characters, where # represents a sheep, while . is grass (or whatever you like, just not sheep). To make the counting a little more interesting, I also decided I wanted to count flocks of sheep instead of single sheep. Two sheep are in the same flock if they share a common side (up, down, right or left). Also, if sheep A is in the same flock as sheep B, and sheep B is in the same flock as sheep C, then sheeps A and C are in the same flock.


Now, I've got a new problem. Though counting these sheep actually helps me fall asleep, I find that it is extremely boring. To solve this, I've decided I need another computer program that does the counting for me. Then I'll be able to just start both these programs before I go to bed, and I'll sleep tight until the morning without any disturbances. I need you to write this program for me.

 

Input

The first line of input contains a single number T, the number of test cases to follow.

Each test case begins with a line containing two numbers, H and W, the height and width of the sheep grid. Then follows H lines, each containing W characters (either # or .), describing that part of the grid.

 

Output

For each test case, output a line containing a single number, the amount of sheep flock son that grid according to the rules stated in the problem description.

Notes and Constraints
0 < T <= 100
0 < H,W <= 100

 

Sample Input

  
  

   
   2
4 4
#.#.
.#.#
#.##
.#.#
3 5
###.#
..#..
#.###
  
  

 

Sample Output

  
  

   
   6
3
  
  

简单的dfs求不连通的区域的个数，只需要遍历查找，然后在符合条件的时候统计数量并且进行深搜，把和这个元素相连的所有区域处理掉，，然后继续循环就可以了....

#include<stdio.h>
#include<string.h>
char map[1005][1005];
int n,m;
void dfs(int x,int y)
{
	if(x<0||x>=n||y<0||y>=m||map[x][y]!='#')//越界或者不符合
	{
		return;
	}
	map[x][y]='.';//处理
	dfs(x+1,y);dfs(x-1,y);//四个方向搜索
	dfs(x,y+1);dfs(x,y-1);
}
void slove()
{
	int cnt=0;
	for(int i=0;i<n;++i)
	{
		for(int j=0;j<m;++j)
		{
			if(map[i][j]=='#')//符合条件的就搜索
			{
				dfs(i,j);
				++cnt;//计数
			}
		}
	}
	printf("%d\n",cnt);
}
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d",&n,&m);
		for(int i=0;i<n;++i)
		{
			scanf("%s",map[i]);
		}
		slove();
	}
	return 0;
}