HDU 1241 Oil Deposits (DFS)
来源:互联网 发布:java简单请假系统 编辑:程序博客网 时间:2024/06/05 03:47
Oil Deposits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10485 Accepted Submission(s): 6090
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
题目意思就是找油块,给了一张地图,@表示油,连在一起的油属于同一个块,这种连在一起包括水平和斜着连接。统计出地图中总的油块数,使用dfs直接解决就可以。注意八个方向的搜索,以及便捷处理就ok了。
#include <cstdio>#include <cstdlib>#include <cstring>const int MAX = 102;char grid[MAX][MAX];int visit[MAX][MAX];int cnt,n,m,tc;void dfs(int x,int y){ if(x<0 || x>=n || y<0 || y>=m)return; if(visit[x][y]==1)return; if(grid[x][y]=='*')return; visit[x][y] = 1; ++tc; dfs(x-1,y);//向八个方向搜索 dfs(x+1,y); dfs(x,y-1); dfs(x,y+1); dfs(x-1,y-1); dfs(x+1,y+1); dfs(x-1,y+1); dfs(x+1,y-1);}int main(){//freopen("in.txt","r",stdin); int i,j; while(scanf("%d %d%*c",&n,&m)!=EOF && m){ cnt = 0; memset(visit,0,sizeof(visit)); for(i=0;i<n;++i){ scanf("%s",grid[i]); } for(i=0;i<n;++i){ for(j=0;j<m;++j){ tc = 0; dfs(i,j); if(tc>=1)++cnt; } } printf("%d\n",cnt); } 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)
- linux下android开发:
- HDU 1198 Farm Irrigation(并查集)
- poj 2362 Square
- Android自定义Button按钮显示样式
- [Hadoop源码解读](二)MapReduce篇之Mapper类 (转)
- HDU 1241 Oil Deposits (DFS)
- C#总结
- RGB24转YUV420P
- [Hadoop源码解读](三)MapReduce篇之Job类 (转)
- 怎样更改SQL Server 2005的身份验证模式
- 9.5 VS2010中调试c++程序的方法
- NFC的安卓事儿(第五篇)
- 几种排序
- [Hadoop源码解读](四)MapReduce篇之Counter相关类 (转)