杭电 1241 Oil Deposits 递归 DFS
来源:互联网 发布:带着淘宝混异界 叶忆落 编辑:程序博客网 时间:2024/05/17 09:02
Oil Deposits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 18322 Accepted Submission(s): 10568
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
注意:
此题是八个方向,所以要定义dir数组,双循环来解。另外输入的时候最好用%s,这样不会有多余\n(第三组数据就是检查\n的)。
#include<stdio.h>int n,m,dir[3]={0,1,-1};char map[110][110];void dfs(int x,int y){int nx,ny,i,j;for(i=0;i<3;i++){for(j=0;j<3;j++){nx=x+dir[i];ny=y+dir[j];if(nx>=0&&ny>=0&&nx<n&&ny<m&&map[nx][ny]=='@'){map[nx][ny]='*';dfs(nx,ny);}}}}int main(){while(~scanf("%d%d",&n,&m),n|m){int i,j,sum=0;for(i=0;i<n;i++){scanf("%s",map[i]);}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;}
0 0
- 杭电 1241 Oil Deposits 递归 DFS
- 【杭电1241】Oil Deposits(DFS)
- 杭电1241Oil Deposits DFS 搜索
- 杭电1241——Oil Deposits(深搜dfs)
- 杭电1241-Oil Deposits
- 杭电1241 Oil Deposits
- 杭电1241Oil Deposits
- 【杭电】[1241]Oil Deposits
- 杭电1241 Oil Deposits
- 杭电 1241 Oil Deposits
- 杭电 hdu 1241 Oil Deposits
- Oil Deposits HDU杭电1241
- 杭电(hdu)1241 Oil Deposits
- hdu 杭电 1241 Oil Deposits
- 【HUD 杭电 1241】Oil Deposits
- 杭电ACM-1241 Oil Deposits
- 杭电1241 HDU acm --Oil Deposits---DFS深度优先算法实现详解
- 杭电acm 1241Oil Deposits(dfs搜索入门题)
- Codeforces Round #Pi (Div. 2) B Berland National Library
- java中的基本类型
- linux生成jar包,并运行,引用该jar包
- Windows10 如何会成为微软的新起点?
- Windows10 如何会成为微软的新起点?
- 杭电 1241 Oil Deposits 递归 DFS
- Spring使用SLF4J代替Commons Logging写日志
- [LeetCode] Distinct Subsequences
- POJ 3061 简单二分
- 机器学习 之 libsvm 参数说明
- 你不经历我的经历,怎么懂我的感受
- Ogre::scene_blend 场景混合
- ubuntu crontab详细介绍
- Java工厂模式