hdu-2952-Counting Sheep

题目大意：数有多少组羊群，上下左右有“#”是一组，广搜

Counting Sheep

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

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 <cstdio>
#include <iostream>
#include <cstring>

using namespace std;

const int maxn = 100 + 10;
char MAP[maxn][maxn];
int cnt, m, n;
int go[4][2]={1,0,-1,0,0,1,0,-1};
bool vis[maxn][maxn];

void dfs(int x, int y)
{
    vis[x][y] = 1;
    for(int i = 0; i < 4; i++)
    {
        int newx = x + go[i][0];
        int newy = y + go[i][1];
        if(newx >= 0 && newx < m && newy >= 0 && newy < n && MAP[newx][newy] == '#' && !vis[newx][newy])
            dfs(newx, newy);
    }
}

int main()
{
    int i, j, k;
    cin>>k;
    while(k--)
    {
        scanf("%d%d", &m, &n);
        for(i = 0; i < m; i++)
            for(j = 0; j < n; j++)
                cin>>MAP[i][j];

        cnt = 0;
        memset(vis, 0, sizeof(vis));
        for(i = 0; i < m; i++)
            for(j = 0; j < n; j++)
            {
                if(MAP[i][j] == '#' && !vis[i][j])
                {
                    cnt++;
                    dfs(i, j);
                }
            }
        printf("%d\n", cnt);
    }
    return 0;
}