Counting Sheep
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1665 Accepted Submission(s): 1077
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.
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.
Notes and Constraints
0 < T <= 100
0 < H,W <= 100
2 4 4 #.#. .#.# #.## .#.# 3 5 ###.# ..#.. #.###
6 3
#include <iostream>
using namespace std;
int n,m,xx[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
char map[111][111];
void dfs(int X,int Y)
{
int i,x,y;
for(i=0;i<4;i++)
{
x=X+xx[i][0];
y=Y+xx[i][1];
if(x>=0&&y>=0&&x<n&&y<m&&map[x][y]=='#')
map[x][y]='.',dfs(x,y);
}
}
int main (void)
{
int t,i,j,s;
cin>>t;
while(t--&&cin>>n>>m)
{
for(i=0;i<n;i++)
for(j=0;j<m;j++)
cin>>map[i][j];
for(i=s=0;i<n;i++)
for(j=0;j<m;j++)
if(map[i][j]=='#')
s++,dfs(i,j);
cout<<s<<endl;
}
return 0;
}