Counting sheep
Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)
Total submission (s): 2039 accepted submission (s): 1342
Problem descriptiona 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.
Inputthe 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.
Outputfor 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
Zero <t <= 100
0
Sample Input
24 4#.#..#.##.##.#.#3 5###.#..#..#.###
Sample output
63
#include<iostream>#include<cstring>using namespace std;#define M 105char c[M][M];int v[M][M];int w[4][2]={1,0,0,1,-1,0,0,-1};int n,m,ans;void dfs(int a,int b){c[a][b]='.';for(int i=0;i<4;i++){int xi=a+w[i][0];int yi=b+w[i][1];if(xi>=0&&xi<n&&yi>=0&&yi<m&&c[xi][yi]=='#')dfs(xi,yi);}}int main(){int T;cin>>T;while(T--){cin>>n>>m;int i,j;for(i=0;i<n;i++)cin>>c[i];ans=0;for(i=0;i<n;i++)for(j=0;j<m;j++)if(c[i][j]=='#'){dfs(i,j);ans++;}cout<<ans<<endl;}return 0;}