HDU 1241 Oil Deposits
来源:互联网 发布:淘宝烟丝 编辑:程序博客网 时间:2024/06/01 09:14
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
输入两个整数n,m,接下来输入一个n*m的字符矩阵。当n与m都等于0时结束输入。在矩阵中有“*”,代表没有油,或@,代表油袋。当@的八个方向有@时,这两个油袋表示相连是一个。
c++
#include <stdio.h>#include<algorithm>#include<iostream>using namespace std;char mp[101][101];int a,b,s;void dg(int i, int j){ if(mp[i][j]!='@'||i<0||j<0||i>=a||j>=b) //当找不到油袋或出界时返回 return; else { mp[i][j]='*'; //将找到的油袋全部改为没有油的状态,并查找它的八个方向 dg(i-1, j-1); dg(i-1, j); dg(i-1, j+1); dg(i, j-1); dg(i, j+1); dg(i+1, j-1); dg(i+1, j); dg(i+1, j+1); }}int main(){ int i, j; while(~scanf("%d%d",&a,&b)) { if(a==0||b==0) break; s=0; for(i=0;i<a;i++) { for(j=0;j<b;j++) { cin>>mp[i][j]; } } for(i=0;i<a;i++) { for(j=0;j<b;j++) { if(mp[i][j] == '@') //当找到油袋时进行深搜,油袋个数加1; { dg(i, j); s++; } } } printf("%d\n",s); } return 0;}
阅读全文
0 0
- HDU 1241Oil Deposits
- HDU---1241Oil Deposits
- Hdu 1241 Oil Deposits
- Hdu 1241 - Oil Deposits
- HDU-1241:Oil Deposits
- hdu 1241 Oil Deposits
- hdu 1241 Oil Deposits
- hdu 1241 Oil Deposits
- hdu - 1241 - Oil Deposits
- HDU-1241Oil Deposits
- hdu 1241 Oil Deposits
- hdu 1241 Oil Deposits
- HDU 1241 Oil Deposits
- hdu 1241 Oil Deposits
- hdu 1241 Oil Deposits
- HDU 1241 Oil Deposits
- hdu-1241-Oil Deposits
- hdu 1241 Oil Deposits
- 4836: [Lydsy2017年4月月赛]二元运算
- 离散题目8
- Spring的自动装配
- Java多线程之内存可见性
- 10、Linux根文件系统的制作
- HDU 1241 Oil Deposits
- 算法导论 练习题 15.3-1
- 数据库设计(降龙十四招式)
- 分布式系统中的几种数据备份模式. 数据可靠性(基本,),数据一致性(脑裂问题,高可靠性容灾性),数据可用性(数据拆分,读写分离),系统扩展性.
- Linux查看文件夹inode数 和 文件数量过多无法ls问题解决
- 简单加密字符串
- 【三】软考—算法
- oracle 里面 :加上变量名是什么意思?
- 膜你赛 Software