HDU 1241Oil Deposits (DFS)
来源:互联网 发布:2016十大网络用语作文 编辑:程序博客网 时间:2024/05/16 06:54
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
DFS的一道经典题目,分八个方向进行搜索即可
#include <stdio.h>#include <string.h>using namespace std;char str[105][105];int vis[105][105],dir[8][2]={-1,-1,-1,0,-1,1,0,-1,0,1,1,-1,1,0,1,1};int count,n,m;void dfs(int i, int j){int a,b;vis[i][j] = 1;for(int k = 0; k < 8; k ++){a = i + dir[k][0];b = j + dir[k][1];if(str[a][b] == '@' && a < n && a >= 0 && b < m && b >= 0 && !vis[a][b])dfs(a,b);}}int main(){int i,j;while(~scanf("%d%d",&n,&m)){if(m==0)break;for(i = 0; i < n; i ++){getchar();scanf("%s",&str[i]);}count = 0;memset(vis,0,sizeof(vis));for(i = 0; i < n; i ++){for(j = 0; j < m; j ++){if(str[i][j] == '@' && !vis[i][j]){count ++;dfs(i,j);}}}printf("%d\n",count);}return 0;}
0 0
- hdu 1241 Oil Deposits(dfs入门)
- HDU 1241 Oil Deposits(DFS)
- HDU 1241Oil Deposits(dfs搜索)
- HDU 1241 Oil Deposits (DFS)
- [ACM] hdu 1241 Oil Deposits(DFS)
- hdu 1241 Oil Deposits(DFS)
- HDU-#1241 Oil Deposits(BFS & 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 1241Oil Deposits (DFS)
- HDU 1241 Oil Deposits(DFS)
- 【HDU】1241--Oil Deposits(DFS)
- 【hdu 1241】 Oil Deposits (dfs+bfs)
- poj 3278 Catch That Cow(bfs)
- String类的hashCode方法的算法解读
- [Algorithm]随机发牌
- 中点画椭圆
- Mac Eclipse Grade Web学习笔记
- HDU 1241Oil Deposits (DFS)
- ListView学习(二)
- Android的数据存储方式
- nginx 实现多域名转发到web服务不同路径
- 图片加载库Glide介绍
- JAVA多线程和并发
- JQuery的tree显示处理插件
- 简单理解Socket及TCP/IP、Http、Socket的区别
- 集合超全关系分析