Oil Deposits
来源:互联网 发布:免费校对软件 编辑:程序博客网 时间:2024/05/09 01:43
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
0122
Source
题意:
本题是典型的dfs深搜
代码:
#include<stdio.h>
#include<string.h>
char a[110][110];
int vis[110][110];
int r,t;
void dfs(int n,int m,int k)
{
int i,j;
if(n>=r||n<0||m>=t||m <0) //注意相等时
return ;
if(vis[n][m]>0||a[n][m]!='@')
return ;
vis[n][m]=1;
for(i=-1;i<=1;i++)
for(j=-1;j<=1;j++)
if(!(i==0&&j==0))
dfs(n+i,m+j,k);
//vis[n][m]=0;
}
int main(){
int i,j,k,d,s;
while(~scanf("%d%d",&r,&t))
{
if(r==t&&r==0)
break;
s=0;
memset(vis,0,sizeof(vis));
for(i=0;i<r;i++)
scanf("%s",a[i]);
for(i=0;i<r;i++)
for(j=0;j<t;j++)
if(vis[i][j]==0&&a[i][j]=='@')
dfs(i,j,++s);
printf("%d\n",s);
}
//while(1);
return 0;
}
#include<string.h>
char a[110][110];
int vis[110][110];
int r,t;
void dfs(int n,int m,int k)
{
int i,j;
if(n>=r||n<0||m>=t||m <0) //注意相等时
return ;
if(vis[n][m]>0||a[n][m]!='@')
return ;
vis[n][m]=1;
for(i=-1;i<=1;i++)
for(j=-1;j<=1;j++)
if(!(i==0&&j==0))
dfs(n+i,m+j,k);
//vis[n][m]=0;
}
int main(){
int i,j,k,d,s;
while(~scanf("%d%d",&r,&t))
{
if(r==t&&r==0)
break;
s=0;
memset(vis,0,sizeof(vis));
for(i=0;i<r;i++)
scanf("%s",a[i]);
for(i=0;i<r;i++)
for(j=0;j<t;j++)
if(vis[i][j]==0&&a[i][j]=='@')
dfs(i,j,++s);
printf("%d\n",s);
}
//while(1);
return 0;
}
0 0
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- oil deposits
- Oil Deposits
- Oil Deposits
- Cuckoo的配置与使用Ubuntu + VirtualBox + windows Xp SP3
- jstl<c:forEach>实现break效果
- loadrunner执行场景时报Error -27040: Data Format Extension: Init: Internal error问题解决
- android 网络图片路径解析和本地图片路径解析的方法 ,base64加密报文解析成bitmap【代码示例】
- 编程学习笔记7--贪心算法
- Oil Deposits
- python 字典
- unity学习之列的基本操作和集合
- easyprogressbar
- 网络最大流--Drainage Ditches
- coyote中的Request&Response&ReuestInfo
- 安卓调试错误 waiting for debugger
- Doing Homework again
- CodePro检查代码