hdoj1241 Oil Deposits

Oil Deposits

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7809    Accepted Submission(s): 4580

Problem Description

The
GeoSurvComp geologic survey company is responsible for detecting
underground oil deposits. GeoSurvComp works with one large rectangular
region of land at a time, and creates a grid that divides the land into
numerous square plots. It then analyzes each plot separately, using
sensing equipment to determine whether or not the plot contains oil. A
plot containing oil is called a pocket. If two pockets are adjacent,
then they are part of the same oil deposit. Oil deposits can be quite
large and may contain numerous pockets. Your job is to determine how
many different oil deposits are contained in a grid.

 

Input

The
input file contains one or more grids. Each grid begins with a line
containing m and n, the number of rows and columns in the grid,
separated by a single space. If m = 0 it signals the end of the input;
otherwise 1 <= m <= 100 and 1 <= n <= 100. Following this
are m lines of n characters each (not counting the end-of-line
characters). Each character corresponds to one plot, and is either `*',
representing the absence of oil, or `@', representing an oil pocket.

 

Output

For
each grid, output the number of distinct oil deposits. Two different
pockets are part of the same oil deposit if they are adjacent
horizontally, vertically, or diagonally. An oil deposit will not contain
more than 100 pockets.

 

Sample Input

1 1

*

3 5

*@*@*

**@**

*@*@*

1 8

@@****@*

5 5

****@

*@@*@

*@**@

@@@*@

@@**@

0 0

Sample Output

0

1

2

2

讲解：@代表油田，寻找共有多少个油田，连在一起的算一个

解法一：不用队列，代码如下：

 #include<iostream>
 #include<string>
 #include<cstring>
 using namespace std;
 char s[][];
 int dir[][]={{-,-},{-,},{-,},{,-},{,},{,-},{,},{,}};
 int n,m;
 void dfs(int x,int y)
 { int i,xx,yy;
     for(i=;i<;i++)
     {
         xx=x+dir[i][];yy=y+dir[i][];
      if(xx<||xx>n || yy< || yy>m  || s[xx][yy]=='*')
                     continue;
         s[xx][yy]='*';
          dfs(xx,yy);
     }
 }
 int main()
 {
     int i,j;
     while(cin>>n>>m && m+n)
     {  int sum=;
     for(i=;i<=n;i++)
        for(j=;j<=m;j++)
            cin>>s[i][j];
        for(i=;i<=n;i++)
           for(j=;j<=m;j++)
           if(s[i][j]=='@')
           {
               sum++;
              // s[i][j]='*';
               dfs(i,j);
           }
           cout<<sum<<endl;
     }
     return ;
 }

解法二：用队列来解

 #include<iostream>
 #include<queue>
 const int MAX=;
 int fangxiang[][]={{-,-},{-,},{-,},{,-},{,},{,-},{,},{,}};
 using namespace std;
 typedef struct dian
 {
     int x;
     int y;
 };
 char map[MAX][MAX];
 int n;
 int m;
 void BFS(int x,int y)
 {
     int i,j;
     queue<dian>que;
     dian in,out;
     in.x=x;
     in.y=y;
     que.push(in);
     while(!que.empty())
     {
         in=que.front();
         que.pop();
         dian next;
         for(i=;i<;i++)
         {
             next.x=out.x=in.x+fangxiang[i][];
             next.y=out.y=in.y+fangxiang[i][];
             if(next.x<||next.x>n||next.y<||next.y>m)
             continue;
             if(map[next.x][next.y]=='@')
             {
              map[next.x][next.y]='*';
              BFS(next.x,next.y);
             }
         }
     }
 }
 int main()
 {
     int i,j,sum;
     while(cin>>n>>m,m)
     {
         sum=;
         for(i=;i<=n;i++)
         {
             for(j=;j<=m;j++)
             {
                 cin>>map[i][j];
             }
         }
         for(i=;i<=n;i++)
         {
             for(j=;j<=m;j++)
             {
                 if(map[i][j]=='@')
                 {
                     sum+=;
                     map[i][j]='*';
                     BFS(i,j);
                 }
             }
         }
         cout<<sum<<endl;
     }
     return ;
 }