杭电2952 Counting Sheep

Counting Sheep

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1279    Accepted Submission(s): 834

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

24 4#.#..#.##.##.#.#3 5###.#..#..#.###

 

Sample Output

63
本题解析：本题就是求羊群的数量，简单的深搜。我的AC代码：
#include <iostream>#include <cstdio>using namespace std;int h,w,dir[4][2]={0,1,0,-1,1,0,-1,0};char a[101][101];int ok(int x,int y){if(x<0||y<0||x>=h||y>=w)return 0;return 1;}void DFS(int x,int y){int i,j,c,d;a[x][y]='.';for(i=0;i<4;i++){c=x+dir[i][0];d=y+dir[i][1];if(!ok(c,d))continue;if(a[c][d]=='#'){a[c][d]='.';DFS(c,d);}}}int main(){int t,i,j,sum;scanf("%d",&t);while (t--){sum=0;scanf("%d%d",&h,&w);for(i=0;i<h;i++)for(j=0;j<w;j++)cin>>a[i][j];for(i=0;i<h;i++)for(j=0;j<w;j++){if(a[i][j]=='#'){DFS(i,j);sum++;}}printf("%d\n",sum);}}