数绵羊- 广搜深搜都行

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

 

 

#include <iostream>
#include <queue>
#include <fstream>
#include <stdio.h>
using namespace std;
struct posiT
{
    int x,y;
};
int steps[4][2]={{-1,0},{1,0},{0,-1},{0,1}};
int main()
{
    queue<posiT> que;
    int T,H,W,count=0;
    posiT temp,newtemp;
    char **map;
    cin>>T;
    while(T--)
    {
        count=0;
        cin>>H>>W;
    map=new char*[H+2];
    for(int i=0;i<H+2;i++)map[i]=new char[W+2];
        for(int i=0;i<=H+1;i++)
        {
            for(int j=0;j<=W+1;j++)
            {
                if(j>=1&&j<=W&&i>=1&&i<=H){cin>>map[i][j];}
                else{map[i][j]='.';}
            }
        }

    for(int i=1;i<=H;i++)
    {
        for(int j=1;j<=W;j++)
        {
            if(map[i][j]=='#')
            {
                count++;
                temp.x=i;temp.y=j;
                que.push(temp);
                while(!que.empty())
                {
                    temp=que.front();
                    que.pop();
                    map[temp.x][temp.y]='.';
                    for(int z=0;z<4;z++)
                    {
                        newtemp.x=temp.x+steps[z][0];
                        newtemp.y=temp.y+steps[z][1];
                        if(map[newtemp.x][newtemp.y]=='#')
                        {
                            que.push(newtemp);
                        }
                    }
                }
            }
        }
    }
    cout<<count<<endl;
    }

}