HDU 1241 Oil Deposits(DFS)
来源:互联网 发布:39健康软件 编辑:程序博客网 时间:2024/05/20 18:54
Oil Deposits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 8419 Accepted Submission(s): 4915
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<iostream>#include<string>using namespace std;int map[100][100];int s;int m,n;int d[8][2]={{-1,-1},{-1,0},{-1,1},{0,-1},{0,1},{1,-1},{1,0},{1,1}};void dfs(int h,int l){ int cx,cy; map[h][l]=1; for(int i=0;i<8;i++) { cx=h+d[i][0]; cy=l+d[i][1]; if((cx>=0&&cx<m)&&(cy>=0&&cy<n)&&map[cx][cy]==0) { map[cx][cy]=1; dfs(cx,cy); } }}int main(){ string str; int i,j; while(cin>>m>>n) { if(m==0) break; for(int i=0;i<m;i++) { cin>>str; for(j=0;j<str.size();j++) if(str[j]=='*') map[i][j]=1; else if(str[j]=='@') map[i][j]=0; } s=0; for(i=0;i<m;i++) for(j=0;j<n;j++) { if(map[i][j]==0) { s++; map[i][j]=1; dfs(i,j); } } cout<<s<<endl; } return 0;}
- hdu 1241 Oil Deposits(dfs入门)
- HDU 1241 Oil Deposits(DFS)
- HDU 1241Oil Deposits(dfs搜索)
- HDU 1241 Oil Deposits (DFS)
- [ACM] hdu 1241 Oil Deposits(DFS)
- hdu 1241 Oil Deposits(DFS)
- HDU-#1241 Oil Deposits(BFS & DFS)
- HDU 1241 Oil Deposits(深搜/DFS)
- hdu 1241 Oil Deposits(DFS)
- HDU 1241 Oil Deposits (DFS)
- hdu 1241 Oil Deposits(DFS)
- hdu 1241 Oil Deposits(DFS)
- 【HDU-1241】Oil Deposits油田(dfs)
- HDU 1241 Oil Deposits(DFS)
- HDU 1241Oil Deposits (DFS)
- HDU 1241 Oil Deposits(DFS)
- 【HDU】1241--Oil Deposits(DFS)
- 【hdu 1241】 Oil Deposits (dfs+bfs)
- 网络协议基础知识
- WPF 图片路径
- Android开源项目汇总
- Android消息机制不完全解析(下)
- Linux的几种并发机制
- HDU 1241 Oil Deposits(DFS)
- 编程珠玑column15 strings of pearls
- 软件开发流程
- C#获取汉字拼音(包含音调)
- MtkEpoClientManager
- Android Activity和Intent机制学习笔记
- NYOJ 题目655 光棍的yy(斐波那契数列 Fibonacci number)
- 新型的按键扫描程序
- C语言高效编程的的四大绝招(转载)