uva 572
来源:互联网 发布:离线基站数据库 300万 编辑:程序博客网 时间:2024/06/05 07:09
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<cstdio>#include<cstring>const int maxn = 100+5;char pic[maxn][maxn];int m , n ,idx[maxn][maxn];void dfs(int x , int y , int id){ if(x<0|| x>=m || y<0||y>=n) return ; if(pic[x][y] !='@' || idx[x][y] >0) return ; idx[x][y] = id; for(int i = -1 ; i<=1 ; i++){ for(int j =-1 ; j<=1 ; j++){ if(i != 0 || j != 0) dfs(x+i , y+j , id); } }}int main(){ while(scanf("%d%d", &m , &n) == 2 && m &&n){ for(int i = 0 ; i<m ; i++) scanf("%s" , pic[i]); memset(idx , 0 , sizeof(idx)); int cnt =0 ; for(int i = 0 ; i< m; i++){ for(int j = 0 ; j<n ; j++){ if(idx[i][j] == 0 && pic[i][j] == '@') dfs(i , j , ++cnt); } } printf("%d\n" , cnt); } return 0;}
- UVa 572
- UVA 572
- UVA 572
- uva 572
- uva --572
- uva 572
- uva 572
- uva 572
- uva 572
- uva 572
- UVA 572
- UVA 572
- UVA 572
- uva 572 - Oil Deposits
- uva 572 - Oil Deposits
- uva 572 - Oil Deposits
- uva-572-Oil Deposits
- UVa 572 - Oil Deposits
- [LeetCode]238. Product of Array Except Self
- 集合框架-Collection集合-3
- CASIO DC-850 DATA-CAL Manual (操作使用方法)
- 9个offer,12家公司,35场面试,从微软到谷歌,应届计算机毕业生的2012求职之路
- 物联网时代来了,大数据也终于有了用武之地
- uva 572
- 字符串算法常用的操作
- 科锐课堂笔记:2017/4/19 虚函数
- 基于网络请求框架的封装
- 接口测试_03
- 系统延迟及定时机制
- java基础-变量类型
- 【IMWeb训练营作业】todo list
- Linux C/C++语言头文件、库文件的查找路径