zoukankan      html  css  js  c++  java
  • poj_1562Oil Deposits

    Oil Deposits
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 10451   Accepted: 5668

    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
    好吧,我是找最简单的DFS学习的,还是理解不深啊,难的不会啊

    #include<iostream>
    #include<fstream>
    using namespace std;
    const int moves[8][2] = {{-1,-1},{-1,0},{-1,1},{0,-1},{0,1},{1,-1},{1,0},{1,1}};
    char maps[105][105];
    int m, n;
    void dfs(int x, int y)
    {
    	int i, p, q;
    	maps[x][y] = '*';
    	for(i = 0; i < 8; i++)
    	{
    		p = x + moves[i][0];
    		q = y + moves[i][1];
    		if(p >= 1 && q >= 1 && p <= m && q <= n && maps[p][q]=='@')
    		{
    			dfs(p,q);
    		}
    	}
    }
    
    int main()
    {
    	ifstream cin("in.txt");
    	while(cin >> m >> n)
    	{
    		if(m == 0)
    		{
    			break;
    		}
    		for(int i = 1; i <= m; i++)
    		{
    			for(int j = 1; j <= n; j++)
    			{
    				cin >> maps[i][j];
    			}
    		}
    		int count = 0;
    		for(int i = 1; i <= m; i++)
    		{
    			for(int j = 1; j <= n; j++)
    			{
    				if(maps[i][j] == '@')
    				{
    					dfs(i, j);
    					count++;
    				}
    			}
    		}
    		cout << count << endl;
    	}
    }



  • 相关阅读:
    网络安全课 06 【Euler、Fermat定理、Miller-Rabin 概率算法】
    网络安全课 05 【保密通信、秘钥分发】
    网络安全课 04 【双重、三重DES】
    状压DP【蓝桥杯 2019_C++_A T9】
    蓝桥杯 2019 C++ A 题解
    凯撒加密【加密+暴力破解+文本单词匹配】
    蓝桥杯 2018 C++ A 题解 【除7、10】
    rest_framework 分页三种
    rest_framework 序列化篇
    rest_framework 解析器(下 全局配置使用)
  • 原文地址:https://www.cnblogs.com/lgh1992314/p/5835111.html
Copyright © 2011-2022 走看看