HDU 1241 Oil Deposits(DFS模板题)
2016-02-12 01:59
519 查看
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
Sample Output
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
//Must so #include<iostream> #include<algorithm> #include<string> #include<cstring> #include<ctype.h> #include<queue> #include<vector> #include<set> #include<cstdio> #include<cmath> #define mem(a,x) memset(a,x,sizeof(a)) #define inf 1<<30 #define NN 1000006 using namespace std; const double PI = acos(-1.0); typedef long long LL; /********************************************************************** DFS模板题 找到一个‘@’,就把他周围的‘@’都算给它,标记一下 同类题还有UVA-572 **********************************************************************/ int row,cow; char mp[111][111]; int dx[8] = {-1,-1,-1,0,0,1,1,1}; int dy[8] = {-1,0,1,-1,1,-1,0,1}; void dfs(int x,int y) { for (int i = 0;i < 8;i++)//8个方向搜索 { int xx = x + dx[i]; int yy = y + dy[i]; if (xx >= 0&&yy >= 0&&xx < row&&yy < cow&&mp[xx][yy] == '@') { mp[xx][yy] = '*';//标记一下 dfs(xx,yy); } } } int main() { while (cin>>row>>cow) { if (row == 0&&cow == 0) break; for (int i = 0;i < row;i++) scanf("%s",mp[i]); int ans = 0; for (int i = 0;i < row;i++) { for (int j = 0;j < cow;j++) { if (mp[i][j] == '@') { ans ++; mp[i][j] = '*'; dfs(i,j); } } } cout<<ans<<endl; } return 0; }
相关文章推荐
- WC2016总结
- hdoj 1394 Minimum Inversion Number(树状数组求逆序对)
- Java认证考试实例疑难辨析(6)
- hdu 1238 Substrings
- Tar 归档命令的一点心得
- C语言的转换----你以为你精通C语言?
- 【慕课笔记】U4 多态 第4节 JAVA中的接口
- spring3 常见异常解决
- 重新审视事件对象event
- 【CodeForces 621A】Wet Shark and Odd and Even
- 容斥原理详细介绍
- 【Gym 100015B】Ball Painting
- 网站百度快照老是不更新怎么办?
- 算法导论例程——切割钢条问题(动态规划)
- 字符串处理笔记-字符串连接
- 【CodeForces 621C】Wet Shark and Flowers
- Spring Bean属性说明
- 第33课:Spark Executor内幕彻底解密:Executor工作原理图、ExecutorBackend注册源码解密、Executor实例化内幕、Executor具体工作内幕
- 【JMeter】Groovy和BeanShell脚本的性能比较
- Python验证IP合法性