HDU 2952: Counting Sheep

Counting Sheep

 

 

///@author Sycamore
///@date Aug 16
#include<bits/stdc++.h>
using namespace std;
char grid[100][101];
bool vis[100][101];
int H,W,dir[4][2]={{-1,0},{1,0},{0,-1},{0,1}};
bool in_grid(const int & x,const int & y)
{
return x>=0&&x<H&&y>=0&&y<W;
}
void DFS(int x,int y)
{
   vis[x][y]=true;
   for(int i=0;i<4;i++)
   {
if(in_grid(x+dir[i][0],y+dir[i][1])
         &&grid[x+dir[i][0]][y+dir[i][1]]=='#'
         &&!vis[x+dir[i][0]][y+dir[i][1]])
         DFS(x+dir[i][0],y+dir[i][1]);
   }
}
int main()
{
int T;
    cin>>T;
    while(T--)
    {
       cin>>H>>W;
       for(int i=0;i<H;i++)
       {
          scanf("%s",grid[i]);
          memset(vis[i],0,sizeof(bool)*W);
       }
int counter=0;
       for(int i=0;i<H;i++)
for(int j=0;j<W;j++)
          {
if(grid[i][j]=='#'&&!vis[i][j])
             {
                counter++;
                DFS(i,j);
             }
          }
       cout<<counter<<'\n';
    }
return 0;
}

 

转载于:https://www.cnblogs.com/zjnu/p/7372821.html