搜索练习题P-16
来源:互联网 发布:单片机独立按键 编辑:程序博客网 时间:2024/05/12 14:34
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 0Sample Output
0122
输入二维数组@表示有油,*表示没油,计算连成片的油田有几块,
就是深搜递归,要有vis[][]标记
#include<iostream>#include<string.h>#include<vector>#include<string>#include<algorithm>using namespace std;char a[101][101];int solve(int x,int y){ if(a[x][y]=='@') { a[x][y]='*'; solve(x-1,y-1); solve(x-1,y); solve(x-1,y+1); solve(x,y-1); solve(x,y+1); solve(x+1,y-1); solve(x+1,y); solve(x+1,y+1); return 1; } return 2;}int main(){ int m,n,cnt=0; while(1) { cin>>m>>n; if(m==0&&n==0) break; memset(a,'t',sizeof(a)); for(int i=1;i<=m;i++) { for(int j=1;j<=n;j++) { cin>>a[i][j]; } } for(int i=1;i<=m;i++) { for(int j=1;j<=n;j++) { if(solve(i,j)==1) {cnt++;} } } cout<<cnt<<endl;cnt=0; }}
阅读全文
0 0
- 搜索练习题P-16
- 搜索练习题
- 搜索 P
- 搜索 P
- 搜索 P
- 搜索-P
- 搜索-P
- ACM练习题P-16 (未通过)Segmentation Fault
- 练习题 No.16 二叉搜索树
- 搜索练习题【题解】
- 搜索练习题B-02
- 搜索练习题D-04
- 搜索练习题F-06
- 搜索练习题G-07
- 搜索练习题H-08
- 搜索练习题I-09
- 搜索练习题J-10
- 搜索练习题L-12
- Dictionary之setValue和setObject的区别(说起来简单,却很容易忽略的知识点)
- leetcode 53. Maximum Subarray
- python 时间戳转标准时间
- rudy环境下sass编译报错的问题
- 【几何】CodeForces
- 搜索练习题P-16
- 旋转变换(二)欧拉角
- 图的邻接表存储 c实现
- 【java面试】网络通信篇
- Android--Scrollview与Listview的嵌套使用
- espeak编译安装
- android retrofit2 文件上传(一)
- Linux下如何清除SVN的用户名和密码
- 深入Java日记——类加载器