dfs八向搜索
来源:互联网 发布:华为p7手机壳淘宝 编辑:程序博客网 时间:2024/05/21 21:42
详细dfs
点击打开链接
Oil Deposits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 30491 Accepted Submission(s): 17659
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
代码如下:
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int n, m,visit[105][105],cnt;char mp[105][105];int d[8][2]={{1,0},{1,1},{1,-1},{0,1},{0,-1},{-1,1},{-1,0},{-1,-1}};void dfs(int x , int y){ if(x<0 || x>=n || y<0 || y>=m) return;//如果越界,终止dfs搜索 visit[x][y] = 1; for(int i = 0;i <8 ;++i){ int nx = x+d[i][0]; int ny = y+d[i][1]; if(visit[nx][ny] == 0 && mp[nx][ny] =='@')//一直搜索,直到所有相邻的@都被标记为1 dfs(nx,ny); }}int main(){ while(scanf("%d%d",&n,&m) && n){ for(int i = 0; i<n;++i) scanf("%s",mp[i]);//输入数组元素 cnt = 0; memset(visit,0,sizeof(visit)); for(int i = 0;i <n; ++i){ for(int j =0; j<m; ++j){ if(!visit[i][j]&&mp[i][j] == '@'){//如果有没有被访问过的@,计数器+1 cnt++; dfs(i,j); } } } printf("%d\n",cnt); } return 0;}
0 0
- dfs八向搜索
- POJ 1321 棋盘问题类似八皇后 dfs搜索
- Checker Challenge(dfs深度搜索 打印八皇后)
- 算法: 无向图的深度优先搜索(dfs)和广度优先搜索(bfs)
- 搜索 dfs
- dfs搜索
- DFS搜索
- 搜索dfs
- 八皇后问题(DFS)
- 八皇后问题 DFS
- 八皇后问题 DFS
- 八皇后问题-DFS
- 八皇后问题 DFS
- 八皇后改DFS
- DFS之八皇后
- 八皇后(dfs)
- 无向图+DFS
- HDU1035 四方向dfs
- 1052. 卖个萌 (20)
- 1053. 住房空置率 (20)
- 如何安装nginx且使用反向代理
- 点击文本框阻止出现搜索记录
- 1054. 求平均值 (20)
- dfs八向搜索
- 2016搜索提高1004
- JSP中使用JSP模板
- 1055. 集体照 (25)
- 关于可哈希
- igraph 分析社交网络
- 1056. 组合数的和(15)
- 1057. 数零壹(20)
- 编写高质量代码:改善Java程序的151个建议-学习笔记(5-8章)