hdu2952

Counting Sheep

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

Total Submission(s): 3276    Accepted Submission(s): 2197

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

 

题目大意：现有一副图，#代表羊，.代表草，如果羊的上下左右方向上有羊则可当做一只，相当于联通块问题，求一共有多少联通块。

题目分析：BFS解决即可，一直编译错误不知道什么原因，但是题目还是挺水的。

代码：

#include <iostream>#include <queue>using namespace std;#define size 110char map[size][size];int to[4][2]={0,1,0,-1,-1,0,1,0};struct node{    int x,y;};queue<node>que;int main(){    int T;    node now,next;    cin>>T;    while(T--)    {        int h,w,n=0;        cin>>h>>w;        for(int i=1;i<=h;i++){            for(int j=1;j<=w;j++){                cin>>map[i][j];            }        }        for(int i=1;i<=h;i++){            for(int j=1;j<=w;j++){                if(map[i][j]=='#'){                    now.x=i;                    now.y=j;                    map[now.x][now.y]='*';                    que.push(now);                    while(!que.empty())                    {                        now=que.front();                        que.pop();                        for(int k=0;k<4;k++){                            next.x=now.x+to[k][0];                            next.y=now.y+to[k][1];                            if(map[next.x][next.y]=='#'&&next.x<=h&&next.x>0&&next.y<=w&&next.y>0){                                que.push(next);                                map[next.x][next.y]='*';                            }                        }                    }                    n++;                }            }        }        cout<<n<<endl;    }    return 0;}