hdu 1241 Oil Deposits
来源:互联网 发布:巨人网络财务报表 编辑:程序博客网 时间:2024/05/29 15:11
Oil Deposits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12187 Accepted Submission(s): 7079
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
Source
#include<cstdio>#include<cstring>#include<cmath>#include<iostream>using namespace std;const int N = 110;char dag[N][N];int dir[8][2] = {1,0,0,1,-1,0,0,-1,1,1,1,-1,-1,1,-1,-1};int vis[N][N], ans, m, n;int dfs(int x, int y){ if(x<0 || y<0 || x>=m || y>=n || vis[x][y] || dag[x][y]=='*') return 0; vis[x][y] = 1; for(int i =0; i<8; i++) dfs(x+dir[i][0], y+dir[i][1]); return 1;}int main(){ while(~scanf("%d%d", &m, &n)){ if(m == 0) break; memset(vis, 0, sizeof(vis)); ans = 0; for(int i = 0; i<m; i++) scanf("%s", dag[i]); for(int i = 0; i<m; i++) for(int j = 0; j<n; j++) if(!vis[i][j]) if(dfs(i, j)) ans++; printf("%d\n", ans); } return 0;}
Recommend
Eddy | We have carefully selected several similar problems for you: 1016 1010 1312 1242 1240
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
- 【算法导论】决策树是满二叉树吗?
- PHP 实现单链表
- 动态生成WCF服务端的简单小例子
- 深入探讨 Java 类加载器(转)
- Eclipse Maven报错:Plugin execution not covered by lifecycle configuration
- hdu 1241 Oil Deposits
- 软件测试资料
- C语言中的字符串
- 1.总览--JUC框架
- linux下编译x264,生成lib库
- Random随机类&Math数学类
- 三遍读书法
- OCP 1Z0 053 241
- FUSE FS的实现(fuse_operations接口的抽象)