zoukankan      html  css  js  c++  java
  • 六月月赛F题

    题目信息:
    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
    
    
    #include<iostream>
    #include<cstring>
    char map[105][105];
    int m,n;
    using namespace std;
    
    void DFS(int i,int j)
    {
    	if(map[i][j]=='@')
    	{
    		map[i][j]='*';
    		if(i-1>0&&map[i-1][j]=='@')
    			DFS(i-1,j);
    		if(i+1<=m&&map[i+1][j]=='@')
    			DFS(i+1,j);
    		if(j-1>0&&map[i][j-1]=='@')
    			DFS(i,j-1);
    		if(j+1<=n&&map[i][j+1]=='@')
    			DFS(i,j+1);
    		if(i-1>0&&j-1>0&&map[i-1][j-1]=='@')
    			DFS(i-1,j-1);
    		if(i-1>0&&j+1<=n&&map[i-1][j+1]=='@')
    			DFS(i-1,j+1);
    		if(i+1<=m&&j-1>0&&map[i+1][j-1]=='@')
    			DFS(i+1,j-1);
    		if(i+1<=m&&j+1<=n&&map[i+1][j+1]=='@')
    			DFS(i+1,j+1);
    	}
    }
    
    int main()
    {
    	int i,j,count;
    	while(cin>>m>>n)
    	{
    		count=0;
    		if(m==0)
    			break;
    		for(i=1;i<=m;++i)
    		{
    			for(j=1;j<=n;++j)
    			{
    				cin>>map[i][j];
    			}
    		}
    		for(i=1;i<=m;++i)
    		{
    			for(j=1;j<=n;++j)
    			{
    				if(map[i][j]=='@')
    				{
    					++count;
    					DFS(i,j);
    				}
    			}
    		}
    		cout<<count<<endl;
    	}
    	return 0;
    }
    
    功不成,身已退
  • 相关阅读:
    俞洪敏励志演讲
    svn 提交排除目录
    (二)2005年我的第一次软件行业创业,烧掉30万、2年时间打水漂的惨痛教训
    COM+ System Application 服务无法启动方法
    版本库迁移(合并)的实现
    没有为此解决方案配置选中要生成的项目
    Oracle 10g 下载地址
    JQuery插件开发[转]
    Web开发中的Form Submit Successful
    网页栅格系统研究(4):技术实现
  • 原文地址:https://www.cnblogs.com/dongsheng/p/2559248.html
Copyright © 2011-2022 走看看