poj 1562 Oil Deposits

Oil Deposits

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 13505		Accepted: 7345

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 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

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

Source

Mid-Central USA 1997

 

 

分析：

只有map[i][j]==0，该位置是新的oil deposit。然后广搜。

#include<iostream>
#include<queue>
#include<cstdio>
#include<cstring>
using namespace std;
int m,n;
short map[105][105];
short dir[8][2]={{-1,-1},{-1,0},{-1,1},{0,1},{1,1},{1,0},{1,-1},{0,-1}};
bool check(int x,int y){
    if(x<0||x>=m||y<0||y>=n||map[x][y])
    return false;
    return true;
}
int main(){
    while(scanf("%d%d",&m,&n)&&m!=0&&n!=0){
        memset(map,0,sizeof(map));
        int i,j;
        for(i=0;i<m;i++){
            for(j=0;j<n;j++){
                char c;
                cin>>c;
                if(c=='*'){
                    map[i][j]=-1;
                }
                else{
                    map[i][j]=0;
                }
            }
        }
        //cout<<1<<endl;
        /*for(i=0;i<m;i++){
            for(j=0;j<n;j++){
                cout<<map[i][j]<<endl;
            }
        }*/
        int count=0;
        for(i=0;i<m;i++){
            for(j=0;j<n;j++){
                if(map[i][j]==0){
                queue<int> q;
                q.push(i*100+j);
                map[i][j]=++count;
                while(!q.empty()){
                    short x=q.front()/100;
                    short y=q.front()%100;
                    q.pop();
                    int k;
                    for(k=0;k<8;k++){
                        short xx=x+dir[k][0];
                        short yy=y+dir[k][1];
                        if(check(xx,yy)){
                            q.push(xx*100+yy);
                            map[xx][yy]=map[x][y];
                        }
                    }
                }    
                }
            }
        }
        /*for(i=0;i<m;i++){
            for(j=0;j<n;j++){
                cout<<map[i][j]<<endl;
            }
        }*/
        cout<<count<<endl;
    }
    return 0;
}