zoukankan      html  css  js  c++  java
  • Oil Deposits

    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<cstdio> #include<cstdlib> #include<cstring> #include<cmath> #include<algorithm> using namespace std; const int maxn=105; char s[maxn][maxn]; int vis[maxn][maxn],m,n; int d[3]= {-1,0,1}; void DFS(int x,int y) { vis[x][y]=1; for(int i=0; i<3; i++) { for(int j=0; j<3; j++) { int nx=x+d[i]; int ny=y+d[j]; if(nx<1||nx>m||ny<1||ny>n) continue; if(s[nx][ny]=='*'||vis[nx][ny]) continue; DFS(nx,ny); } } } int main() { while(~scanf("%d%d",&m,&n),m+n) { memset(vis,0,sizeof(vis)); for(int i=1; i<=m; i++) scanf("%s",s[i]+1); int ans=0; for(int x=1; x<=m; x++) { for(int y=1; y<=n; y++) { if(s[x][y]=='@'&&!vis[x][y]) { ans++; DFS(x,y); } } } printf("%d ",ans); } return 0; }
  • 相关阅读:
    如何退出Vi编辑状态
    iOS开发第三方工具——MBProgressHUD
    iOS开发第三方工具——AFNetworking
    iOS开发第三方工具——JSONKit
    iOS开发第三方工具——SSToolkit
    TestFlight工具的使用
    Block 的循环引用
    在 iOS 9 中使用 UIStackView 的总结
    说说视图层架构
    iOS开发技巧(2)
  • 原文地址:https://www.cnblogs.com/csustwj/p/4292992.html
Copyright © 2011-2022 走看看