hdu 1241 Oil Deposits
来源:互联网 发布:淘宝巴黎心店卖假货 编辑:程序博客网 时间:2024/06/10 02:20
Oil Deposits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12303 Accepted Submission(s): 7151
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 <iostream>using namespace std;char map[105][105];bool visit[105][105];void dfs(int i,int j){ if(visit[i][j]||map[i][j]=='*') { return; } visit[i][j]=1; 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 m,n; int ans; while (cin>>n>>m && (n||m)) { ans=0; memset(map, '*', sizeof(map)); memset(visit,0, sizeof(visit)); for (int i=1; i<=n; i++) //加边界 { for (int j=1; j<=m; j++) { cin>>map[i][j]; } } for (int i=1;i<=n ; i++) { for (int j=1; j<=m; j++) { if(!visit[i][j] && map[i][j]=='@') { dfs(i,j); ans++; } } } cout<<ans<<endl; } return 0;}
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
- java——GUI
- JMX经验点滴
- 提升HBase写性能
- java多线程(二)线程的互斥
- 线性时间内筛素数和欧拉函数
- hdu 1241 Oil Deposits
- 赛门铁克250-316大脑转储
- wince 获取项目当前路径
- oracle 可传输表空间
- java多线程(三)线程之间的通信
- 仿射变换
- android的listview中setselection()不起作用的解决方案
- map的遍历 以及 集合向数组的转换
- 关于cvCreateFileCapture()读取视频文件失败的解决方案