首页
学习
活动
专区
圈层
工具
发布
首页
学习
活动
专区
圈层
工具
MCP广场
社区首页 >专栏 >【hdu】1241-Oil Deposits(DFS)(水)

【hdu】1241-Oil Deposits(DFS)(水)

作者头像
FishWang
发布2025-08-26 19:00:52
发布2025-08-26 19:00:52
9300
代码可运行
举报
运行总次数:0
代码可运行

Oil Deposits Crawling in process... Crawling failed Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u

Submit Status

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

代码语言:javascript
代码运行次数:0
运行
复制
      1 1
*
3 5
*@*@*
**@**
*@*@*
1 8
@@****@*
5 5 
****@
*@@*@
*@**@
@@@*@
@@**@
0 0 

Sample Output

代码语言:javascript
代码运行次数:0
运行
复制
      0
1
2
2 

这道题难度不大,但是因为读题错误而WA了3次,再次贴上,警示自己。

代码如下:

代码语言:javascript
代码运行次数:0
运行
复制
#include <stdio.h>
int x,y,W,H,num;
char map[111][111];
int ans[5000];
int move_x[8]={0,0,-1,1,1,1,-1,-1};
int move_y[8]={1,-1,0,0,1,-1,-1,1};		//移动
void dfs(int x,int y)
{
	if (x<0||x>=H||y<0||y>=W)
		return;
	if (map[x][y]=='*')
		return;
	map[x][y]='*';
	for (int i=0;i<8;i++)
		dfs(x+move_x[i],y+move_y[i]);
}
int main()
{
	while (~scanf ("%d %d",&H,&W) && H)
	{
		for (int i=0;i<H;i++)
		{
			scanf ("%s",map[i]);
		}
		num=0;
		for (int i=0;i<H;i++)
		{
			for (int j=0;j<W;j++)
			{
				if (map[i][j]=='@')
				{
					dfs(i,j);
					num++;
				}
			}
		}
		printf ("%d\n",num);
	}
	return 0;
}
本文参与 腾讯云自媒体同步曝光计划,分享自作者个人站点/博客。
原始发表:2025-08-26,如有侵权请联系 cloudcommunity@tencent.com 删除

本文分享自 作者个人站点/博客 前往查看

如有侵权,请联系 cloudcommunity@tencent.com 删除。

本文参与 腾讯云自媒体同步曝光计划  ,欢迎热爱写作的你一起参与!

评论
登录后参与评论
0 条评论
热度
最新
推荐阅读
领券
问题归档专栏文章快讯文章归档关键词归档开发者手册归档开发者手册 Section 归档