hdoj 1241 Oil Deposits
来源:互联网 发布:新注册的淘宝能开店吗 编辑:程序博客网 时间:2024/05/19 16:21
Oil Deposits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18178 Accepted Submission(s): 10477
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#include<stdio.h>char a[100][100];int m,n;void dfs(int x,int y){if(x<0||x>=m||y<0||y>=n||a[x][y]=='*')return;a[x][y]='*';dfs(x,y+1);dfs(x,y-1);dfs(x+1,y);dfs(x+1,y-1);dfs(x+1,y+1);dfs(x-1,y);dfs(x-1,y+1);dfs(x-1,y-1);}int main(){int i,j,cnt;while(scanf("%d%d",&m,&n),m|n){cnt=0;for(i=0;i<m;i++)scanf("%s",&a[i]);for(i=0;i<m;i++){for(j=0;j<n;j++){if(a[i][j]=='@'){cnt++;dfs(i,j);}}}printf("%d\n",cnt);}return 0;}
0 0
- hdoj 1241 Oil Deposits
- hdoj 1241 Oil Deposits
- HDOJ 1241 Oil deposits
- HDOJ 1241 Oil Deposits
- HDOJ 1241 Oil Deposits
- HDOJ 1241 Oil Deposits
- hdoj 1241 Oil Deposits
- hdoj 1241 Oil Deposits
- hdoj 1241 Oil Deposits
- hdoj 1241 Oil Deposits
- hdoj-1241-Oil Deposits
- HDOJ-1241 Oil Deposits
- HDOJ - 1241 Oil Deposits
- hdoj-1241【Oil Deposits】
- hdoj 1241 Oil Deposits
- hdoj-1241 Oil Deposits
- HDOJ--1241--Oil Deposits【DFS】
- ACM HDOJ 1241 (Oil Deposits)
- 南阳 oj 重建二叉树 题目756
- linux 实际用户ID、有效用户ID以及保存的设置用户ID
- 黑马程序员---iOS基础---OC中的ARC、分类、block
- 离线下载的免费网站
- hdu5335&15年杭电多校集训(4)i题(bfs+策略)
- hdoj 1241 Oil Deposits
- 文件上传和下载(转)
- 膜拜大神
- 实际用户ID,有效用户ID及设置用户ID
- MS SQL执行大脚本文件时,提示“内存不足”的解决办法
- HUD1.2.4 Nasty Hacks
- Kali-linux安装之后的简单设置
- 有多个构造器如何初始化
- 黑马程序员—JAVA基础—网络编程