hdu 1241 Oil Deposits
2016-09-26 21:57
381 查看
题目描述:
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
Sample Output
题目分析:
dfs水过~~~~
AC代码:
#include<iostream>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#define LIM (sx>=0&&sx<n&&sy<=m&&sy>=0)
using namespace std;
int m,n;
int num;
int x[]={-1,-1,-1,0,0,1,1,1};//行
int y[]={-1,0,1,-1,1,-1,0,1};//列
char map[105][105];
void dfs(int x_,int y_)
{
for(int i=0;i<8;i++)
{
int sx=x_+x[i],sy=y_+y[i];
if(LIM&&map[sx][sy]=='@')
{
map[sx][sy]='*';
dfs(sx,sy);
}
}
}
int main()
{
while(1)
{
scanf("%d%d",&n,&m);
if(n==0&&m==0)
break;
num=0;
for(int i=0;i<n;i++)
{
scanf("%s",map[i]);
}
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
if(map[i][j]=='@')
{
map[i][j]='*';
num++;
dfs(i,j);
}
}
}
cout<<num<<endl;
}
return 0;
}
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
题目分析:
dfs水过~~~~
AC代码:
#include<iostream>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#define LIM (sx>=0&&sx<n&&sy<=m&&sy>=0)
using namespace std;
int m,n;
int num;
int x[]={-1,-1,-1,0,0,1,1,1};//行
int y[]={-1,0,1,-1,1,-1,0,1};//列
char map[105][105];
void dfs(int x_,int y_)
{
for(int i=0;i<8;i++)
{
int sx=x_+x[i],sy=y_+y[i];
if(LIM&&map[sx][sy]=='@')
{
map[sx][sy]='*';
dfs(sx,sy);
}
}
}
int main()
{
while(1)
{
scanf("%d%d",&n,&m);
if(n==0&&m==0)
break;
num=0;
for(int i=0;i<n;i++)
{
scanf("%s",map[i]);
}
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
if(map[i][j]=='@')
{
map[i][j]='*';
num++;
dfs(i,j);
}
}
}
cout<<num<<endl;
}
return 0;
}
相关文章推荐
- HDU - 1241 - Oil Deposits
- hdu 1241 Oil Deposits (dfs经典入门)
- hdu 1241 Oil Deposits 简单八个方向的DFS
- Oil Deposits 石油储藏HDU - 1241 BFS
- hdu 1241 Oil Deposits
- hdu 题目1241 Oil Deposits(简单DFS)
- HDU 1241 Oil Deposits (DFS)
- HDU 1241 Oil Deposits (基础DFS 或者 BFS)
- hdu 1241 Oil Deposits 简单dfs
- hdu 1241 Oil Deposits (一次dfs搞定有某有)
- hdu-1241 Oil Deposits (and) nyoj-27 水池数目
- L_Oil Deposits(HDU_1241)
- HDU 1241 Oil Deposits
- hdu 1241 Oil Deposits
- HDU 1241 Oil Deposits 深搜(DFS)
- HDU 1241 Oil Deposits
- hdu 1241 Oil Deposits
- HDU - 1241——Oil Deposits
- hdu 1241 Oil Deposits
- hdu 1241 Oil Deposits_dfs or bfs