http://acm.hdu.edu.cn/showproblem.php?pid=2952
Counting Sheep
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1502 Accepted Submission(s): 979
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.
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.
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
Notes and Constraints
0 < T <= 100
0 < H,W <= 100
Sample Input
2 4 4 #.#. .#.# #.## .#.# 3 5 ###.# ..#.. #.###
Sample Output
6 3
AC代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;
struct Node
{
int x,y;
};
char map[110][110];
int dir[4][2]={{0,1},{0,-1},{1,0},{-1,0}};
int Bfs(int w, int h)
{
Node now,next;
queue<Node> q;
int i,j,num,t;
num = 0;
for(i = 1; i <= h; i++)
{
for(j = 1; j <= w; j++)
{
if(map[i][j] == '#')
{
num++;
now.x = i;
now.y = j;
q.push(now);
while(!q.empty())
{
now = q.front();
q.pop();
map[now.x][now.y] = '.';
for(t = 0; t < 4; t++)
{
next.x = now.x+dir[t][0];
next.y = now.y+dir[t][1];
if(map[next.x][next.y] == '#')
{
map[next.x][next.y] = '.';
q.push(next);
}
}
}
}
}
}
return num;
}
int main()
{
int n,w,h,i,j,num;
scanf("%d",&n);
while(n--)
{
memset(map,'.',sizeof(map)); //初始化
cin >> h >> w;
for(i = 1; i <= h; i++)
{
for(j = 1; j <= w; j++)
{
cin >> map[i][j];
}
}
num = Bfs(w,h);
printf("%d\n",num);
}
return 0;
}