题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2952
Counting Sheep
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
题目分析:向4个方向搜索,求连通块的数目。
#include<iostream>
#include<queue>
using namespace std;
char mp[101][101];
int dir[4][2]={{0,1},{0,-1},{1,0},{-1,0}};
int m,n,sum;
struct node{
int x,y;
};
bool check(node t)
{
if(t.x>=1&&t.x<=n&&t.y>=1&&t.y<=m&&mp[t.x][t.y]=='#')
return 1;
else
return 0;
}
void bfs(int sx,int sy)
{
queue<node>q;
node now,next;
now.x=sx;
now.y=sy;
q.push(now);
while(!q.empty())
{
now=q.front();
q.pop();
for(int i=0;i<4;i++)
{
next.x=now.x+dir[i][0];
next.y=now.y+dir[i][1];
if(check(next))
{
mp[next.x][next.y]='.';
q.push(next);
}
}
}
}
int main()
{
int T;
cin>>T;
while(T--)
{
cin>>n>>m;
if(m==0&&n==0)
break;
sum=0;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
cin>>mp[i][j];
}
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
if(mp[i][j]=='#')
{
sum++;
mp[i][j]='.'; //消除同一连通块的所有标记
bfs(i,j);
}
}
}
cout<<sum<<endl;
}
return 0;
}
dfs代码如下:
#include<iostream>
using namespace std;
char mp[101][101];
int n,m;
int dir[4][2]={{-1,0},{1,0},{0,1},{0,-1}};
bool check(int x,int y)
{
if(x>=0&&x<n&&y>=0&&y<m&&mp[x][y]=='#')
return 1;
else
return 0;
}
void dfs(int sx,int sy)
{
for(int i=0;i<4;i++)
{
int xx=sx+dir[i][0];
int yy=sy+dir[i][1];
if(check(xx,yy))
{
mp[xx][yy]='.';
dfs(xx,yy);
}
}
}
int main(){
int T;
cin>>T;
while(T--)
{
cin>>n>>m;
if(n==0&&m==0)
break;
int sum=0;
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
cin>>mp[i][j];
}
}
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
if(mp[i][j]=='#')
{
mp[i][j]='.';
dfs(i,j);
sum++;
}
}
}
cout<<sum<<endl;
}
return 0;
}