170人阅读 评论(0)

# Oil Deposits

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 16651    Accepted Submission(s): 9576

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
0
1
2
2

#include<iostream>
#include<string.h>
#include<math.h>
#include<stdio.h>
#include<algorithm>
#include<queue>
using namespace std;
#define  LL __int64
char a[101][101];
int n,m;
struct node
{
int x,y;
};
int nex[8][2]={0,1,1,0,-1,0,0,-1,-1,1,1,-1,1,1,-1,-1};
void bfs(int x,int y)
{
node cur,now;
cur.x=x,cur.y=y;
queue<node> q;
q.push(cur);
while(!q.empty())
{
cur=q.front();
q.pop();
for(int i=0;i<8;i++)
{
now.x=cur.x+nex[i][0];
now.y=cur.y+nex[i][1];
if(now.x>=0&&now.x<n&&now.y>=0&&now.y<m&&a[now.x][now.y]=='@')
{
a[now.x][now.y]='.';
q.push(now);
}
}
}
return ;
}
int main()
{
while(scanf("%d%d",&n,&m)&&n&&m)
{
for(int i=0;i<n;i++)
scanf("%s",a[i]);
int sum=0;
LI:  for(int i=0;i<n;i++)
for(int j=0;j<m;j++)
if(a[i][j]=='@')
{
a[i][j]='.';
bfs(i,j);
sum++;
goto LI;
}
printf("%d\n",sum);
}
}


#include<stdio.h>
#include<algorithm>
using namespace std;
char a[200][200];
int n,m;
int net[8][2]={0,1,1,0,-1,0,0,-1,-1,1,1,-1,1,1,-1,-1};
void dfs(int i,int j)
{
a[i][j]='*';
for(int k=0; k<8; k++)
{
int x=i+net[k][0];
int y=j+net[k][1];
if(x<0||x>=m||y<0||y>=n||a[x][y]=='*')
continue;
dfs(x,y);
}
}
int main()
{
while(scanf("%d%d",&m,&n)&&n&&m)
{
for(int i=0; i<m; i++)
scanf("%s",a[i]);
int sum=0;
for(int i=0; i<m; i++)
for(int j=0; j<n; j++)
if(a[i][j]=='@')
{
dfs(i,j);
//返回这里即意味着已经找完了一处
sum++;
}
printf("%d\n",sum);
}
}


0
0

【直播】机器学习&数据挖掘7周实训--韦玮
【套餐】系统集成项目管理工程师顺利通关--徐朋
【直播】3小时掌握Docker最佳实战-徐西宁
【套餐】机器学习系列套餐（算法+实战）--唐宇迪
【直播】计算机视觉原理及实战--屈教授
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之矩阵--黄博士
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之凸优化--马博士
【套餐】Javascript 设计模式实战--曾亮

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：13534次
• 积分：555
• 等级：
• 排名：千里之外
• 原创：43篇
• 转载：0篇
• 译文：0篇
• 评论：2条
阅读排行
评论排行
最新评论