Oil Deposits
来源:互联网 发布:怎么在淘宝上购物流程 编辑:程序博客网 时间:2024/06/05 17:21
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
0
1
2
2
本题的题意是找一块网中有多少油田,油田相连即算做同一块油田。
本题思路:相邻的有油田即算作一个油田,因此它要向八个方向进行搜索,采用深搜,从开始搜到结束,再反过来继续搜另一种情况。
代码:
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;char map[100][100];int n,m;int dir[8][2]={{1,0},{-1,0},{0,1},{0,-1},{1,1},{1,-1},{-1,1},{-1,-1}};struct node{ int x,y;};void dfs(node p){ node q; for(int i=0;i<8;i++) { q.x=p.x+dir[i][0]; q.y=p.y+dir[i][1]; if(q.x>=0&&q.y>=0&&q.x<n&&q.y<m&&map[q.x][q.y]=='@') { map[q.x][q.y]='*'; dfs(q); } }}int main(){ while(~scanf("%d%d",&n,&m)) { node q; int ans=0; if(n==0&&m==0) break; for(int i=0;i<n;i++) for(int j=0;j<m;j++) cin>>map[i][j]; for(int i=0;i<n;i++) { for(int j=0;j<m;j++) { q.x=i; q.y=j; if(map[q.x][q.y]=='@') { map[q.x][q.y]='*'; dfs(q); ans++; } } } cout<<ans<<endl; } return 0;}
4 0
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- oil deposits
- Oil Deposits
- Oil Deposits
- 蓝桥杯 算法训练 Hankson的趣味题 (唯一分解定理)
- 遍历HashMap的四种方法
- Python中的面向对象特性(更新中……)
- 快速排序算法分析
- JDBC连接数据库及具体实现代码
- Oil Deposits
- 周志华教授gcForest(多粒度级联森林)算法预测股指期货涨跌
- python的列表和字典(简单介绍)
- ecshop 添加手机号码验证唯一性(手机版)
- Fragment防手抖
- Android 5.0新控件 CoordinatorLayout | 协调布局 介绍及使用详情
- 两点之间的所有最短路径
- JQuery的Ajax跨域请求的解决方案
- java_高级_网络编程