该问题描述了一个关于GeoSurvComp地质调查公司的场景，该公司通过网格分析土地以检测石油沉积物。输入包含多个网格，每个网格表示土地区域，其中'@'表示油藏。任务是计算每个网格中不同油藏的数量，相邻的油藏视为同一油藏。题目给出了输入输出示例，并提到这是一个经典的DFS算法入门问题。AC代码中包含了DFS的实现，用于标记和计算油藏。
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.
问题描述
GeoSurvComp地质调查公司负责检测地下石油储量。GeoSurvComp一次与一个大的矩形区域一起工作，并创建一个网格，将土地划分为多个方形图。然后，它使用传感设备分别分析每个图，以确定该图是否含有油。含有油的地块称为口袋。如果两个口袋相邻，则它们是相同油藏的一部分。油沉积物可能非常大并且可能包含许多口袋。您的工作是确定网格中包含多少不同的油藏。
Input
The input file contains one or more grids. Each grid begins with a line containing m and n
最低0.47元/天 解锁文章
3678
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
