Oil Deposits
来源:互联网 发布:中国大学生网络党校 编辑:程序博客网 时间:2024/05/08 15:43
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#include <stdio.h>#include<algorithm>#include<iostream>using namespace std;char map[101][101];int n, m, p;void dfs(int i, int j)//递归函数{ if(map[i][j]!='@' || i<0 || j<0 || i>=m || j>=n) return; else { map[i][j]='*';//扫过的都变成'*' dfs(i-1, j-1); dfs(i-1, j); dfs(i-1, j+1); dfs(i, j-1); dfs(i, j+1); dfs(i+1, j-1); dfs(i+1, j); dfs(i+1, j+1); }}int main(){ int i, j; while(scanf("%d%d",&m,&n)!=EOF) { if(m==0 || n==0) break; p = 0; for(i = 0; i < m; i++) for(j = 0; j < n; j++) //scanf("%c",&map[i][j]); cin>>map[i][j]; for(i = 0; i < m; i++) { for(j = 0; j < n; j++) { if(map[i][j] == '@') { dfs(i, j); p++; } } } printf("%d\n",p); } return 0;}
0 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
- 统计模型之间的比较
- Hibernate,JDBC 区别
- "?:"运算符类型转换问题
- ios Nscoding协议 序列化 便于磁盘保存
- SQL查找删除重复行
- Oil Deposits
- 静态成员和非静态成员
- DataGridView控件基本操作1
- 观察者模式(监听器模式)
- Gosat卫星过境
- 焊接电路板技巧----百度文章
- 4) 将多元函数转换为一元函数unaryFunctionConverter [原创,泛型编程,自由下载转载,需注明出处]
- Android横竖屏切换
- “古今”网站欣赏