hdu2952 Counting Sheep

Counting Sheep

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)

Total Submission(s) : 49   Accepted Submission(s) : 38

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

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

很正常的数联通块的题目。

#include<iostream>
#include<cmath>
#include<algorithm>
#include<iomanip>
#include<cstring>
#include<cstdio>
#include<queue>
using namespace std;
int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};
int x,y;
char ma[111][111];
bool check(int x2,int y2)
{
    if(x2>=1&&y2>=1&&x2<=x&&y2<=y&&ma[x2][y2]=='#')
    return 1;
    return 0;
}
void dfs(int x1,int y1)
{
    for(int i=0;i<4;i++)
    {
        int xx=x1+dx[i];
        int yy=y1+dy[i];
        if(check(xx,yy))
        {
            ma[xx][yy]='.';
            dfs(xx,yy);
        }
    }
}
int main()
{     
    int t;
    cin>>t;
    while(t--){
        int ans=0;
        cin>>x>>y;
        memset(ma,0,sizeof(ma));
        int i,j,k;
        for(i=1;i<=x;i++)
        for(j=1;j<=y;j++)
        cin>>ma[i][j];
        for(i=1;i<=x;i++)
        for(j=1;j<=y;j++)
        {
            if(ma[i][j]=='#')
            {
                ma[i][j]='.';
                dfs(i,j);
                ans++;
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}