hdu 1241 Oil Deposits (DFS入门)
2017-09-19 11:28
453 查看
Oil Deposits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 33901 Accepted Submission(s): 19708
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 <stdio.h> char map[200][200]; int n,m; void dfs(int x,int y) { if(x<0||y<0||x>=n||y>=m)return; if(map[x][y]=='*')return; map[x][y]='*'; dfs(x+1,y);dfs(x+1,y-1);dfs(x+1,y+1); dfs(x-1,y);dfs(x-1,y-1);dfs(x-1,y+1); dfs(x,y-1);dfs(x,y+1); } int main(int argc, char *argv[]) { while(scanf("%d %d",&n,&m),n+m) { getchar(); int i,j; for(i=0;i<n;i++) { scanf("%s",map[i]); } int sum=0; for(i=0;i<n;i++) { for(j=0;j<m;j++) { if(map[i][j]=='@') { dfs(i,j); sum++; } } } printf("%d\n",sum); } return 0; }
因为把@变为'“*”所以不需要标记
#include <stdio.h>
int n,m;
char map[100][100];
void dfs(int x,int y)
{
if(x<0||y<0||x>=n||y>=m)
return ;
if(map[x][y]=='*')
return ;
map[x][y]='*';
dfs(x+1,y);dfs(x+1,y-1);dfs(x+1,y+1);
dfs(x-1,y);dfs(x-1,y-1);dfs(x-1,y+1);
dfs(x,y-1);dfs(x,y+1);
}
int main(int argc, char *argv[])
{
while(scanf("%d %d",&n,&m),n+m)
{
int i,j;
for(i=0;i<n;i++)
{
scanf("%s",map[i]);
}
int sum=0;
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
if(map[i][j]=='@')
{
sum++;
dfs(i,j);
}
a742
}
}
printf("%d\n",sum);
}
return 0;
}
相关文章推荐
- hdu 1241 Oil Deposits (dfs经典入门)
- POJ 1562 Oil Deposits (HDU 1241 ZOJ 1562) DFS
- hdu 题目1241 Oil Deposits(简单DFS)
- 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 (DFS)
- HDU 1241 Oil Deposits (DFS)
- HDU 1241 Oil Deposits【DFS】
- HDU 1241 Oil Deposits 深搜(DFS)
- hdu 1241 Oil Deposits 简单dfs
- HDU 1241 Oil Deposits (DFS)
- HDU 1241 Oil Deposits (DFS)
- HDU-1241-Oil Deposits【DFS深度搜索模版题】
- Oil Deposits(dfs)HDU - 1241
- HDU 1241 Oil Deposits【dfs&bfs】
- hdu1241——Oil Deposits(DFS)
- HDU--1241:Oil Deposits (DFS)