hdu-1241 Oil Deposits

最新推荐文章于 2021-08-23 22:58:21 发布

转载最新推荐文章于 2021-08-23 22:58:21 发布 · 53 阅读

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/Trojan00/p/8981376.html

本文介绍了一种用于探测地下油藏分布的算法实现。通过深度优先搜索（DFS）方法，该算法能有效识别并计数网格中独立的油藏沉积。输入为一系列矩形网格，每个网格由星号（*）和井号（@）构成，分别表示无油区域和含油口袋。算法的主要步骤包括读取网格数据、定义搜索方向、执行DFS搜索并统计不同油藏数量。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

代码如下:

 1 #include "stdafx.h"
 2 #include<iostream>
 3 #include<string>
 4 using namespace std;
 5 
 6 int m, n;
 7 char G[101][101];
 8 int dir[8][2] = { { -1,-1 },{ -1,0 },{ -1,1 },{ 0,1 },{ 0,-1 },{ 1,1 },{ 1,0 },{ 1,-1 } };
 9 void DFS(int x, int y)
10 {
11     G[x][y] = '*';
12     for (int i = 0; i < 8; i++)
13     {
14         int zx = x + dir[i][0];
15         int zy = y + dir[i][1];
16         if (G[zx][zy] == '@'&&zx >= 0 && zx < m && zy>=0 && zy < n)
17             DFS(zx, zy);
18     }
19 }
20 
21 int main()
22 {
23     while (cin >> m >> n)
24     {
25         if (m == 0 && n == 0)break;
26 
27         for (int i = 0; i < m; i++)
28             for (int j = 0; j < n; j++)
29                 cin >> G[i][j];
30         int sum = 0;
31         for (int i = 0; i<m; i++)
32             for (int j = 0; j < n; j++)
33             {
34                 if (G[i][j] == '@')
35                 {
36                     DFS(i, j);
37                     sum++;
38                 }
39             }
40         cout << sum << endl;
41     }
42     return 0;
43 }