hdoj1241
来源:互联网 发布:美工刀片厚度 编辑:程序博客网 时间:2024/06/13 09:36
Oil Deposits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)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
Mid-Central USA 1997
Recommend
Eddy
#include<stdio.h>char map[100][100];int m,n;int sum;int direction[8][2]={{-1,1},{0,1},{1,1},{-1,0},{1,0},{-1,-1},{0,-1},{1,-1}};int inarea(int x,int y){return x<m&&y<n&&x>=0&&y>=0&&map[x][y]=='@';}void dfs(int x,int y){for(int i=0;i<8;i++){ map[x][y]='#';if(inarea(x+direction[i][0],y+direction[i][1])&&map[x+direction[i][0]][y+direction[i][1]]!='#')dfs(x+direction[i][0],y+direction[i][1]);}}int main(void){while(scanf("%d%d",&m,&n)&&m&&n){getchar(); sum=0;for(int i=0;i<m;i++){for(int j=0;j<n;j++){scanf("%c",&map[i][j]);}getchar();}for(int i=0;i<m;i++){for(int j=0;j<n;j++){if(map[i][j]=='@'){dfs(i,j);++sum;}}}printf("%d\n",sum);}return 0;}
- hdoj1241
- hdoj1241
- hdoj1241
- HDOJ1241
- hdoj1241 Oil Deposits
- DFS基础题-----HDOJ1241
- HDOJ1241 Oil Deposits
- hdoj1241 Oil Deposits
- Oil Deposits<hdoj1241>
- HDOJ1241 Oil Deposits(DFS模板题)
- HDOJ1241 Oil Deposits(DFS,八连通块)
- yii widget使用
- 浅谈二分搜索
- this的作用
- 常见算法:C语言中链表的操作(创建,插入,删除,输出)
- 网站注册的时候,烦人的生日年份选择的改进想法
- hdoj1241
- VC6.0里面怎么恢复默认的窗口
- 百度搜索引擎中文分词的三点原理
- this指针用法
- 区别C#中的两个属性(Property和Attribute)
- [POJ]2301 Beat the Spread!
- linux虚拟机VMware vSphere上安装VMware Tools
- Android下增加APK访问/data目录权限的方法
- centos No package 'glib-2.0' found解决办法