【DFS】HDU1241Oil Deposits
来源:互联网 发布:数据库表结构属性 编辑:程序博客网 时间:2024/06/05 06:38
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1241
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>#include<cstring>using namespace std;char a[110][110];int b[100100];int n,m;int pos[8][2]={{0,1},{1,1},{1,0},{1,-1},{0,-1},{-1,-1},{-1,0},{-1,1}};void dfs(int x,int y){ if(x<0||y<0||x>=n||y>=m){ return; } for(int i=0;i<8;i++){ int xx=x+pos[i][0]; int yy=y+pos[i][1]; if(a[xx][yy]=='@'){ a[xx][yy]='*'; dfs(xx,yy); } }}int main(){ while(cin>>n>>m&&n+m){ int cnt=0; for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ cin>>a[i][j]; if(a[i][j]=='@'){ b[cnt++]=i*101+j; } } } int ans=0; for(int i=0;i<cnt;i++){ int x=b[i]/101; int y=b[i]%101; if(a[x][y]=='@') dfs(x,y),ans++; } cout<<ans<<endl; } return 0;}
0 0
- hdu1241Oil Deposits(dfs)
- 【DFS】HDU1241Oil Deposits
- hdu1241Oil Deposits(dfs&&bfs)
- hdu1241Oil Deposits(搜索--深搜DFS)
- hdu1241Oil Deposits
- hdu1241Oil Deposits
- HDU1241Oil Deposits
- Hdu1241Oil Deposits
- HDU1241Oil Deposits(深搜)
- hdu1241Oil Deposits 深广搜
- Poj1562Oil Deposits,DFS
- Oil Deposits hdu1241 dfs
- Oil Deposits poj DFS
- POJ1562:Oil Deposits(DFS)
- HDU1241:Oil Deposits(DFS)
- hdu1241(DFS Oil Deposits )
- UVa572 Oil Deposits(DFS)
- HDU1241_Oil Deposits(BFS)+(DFS)
- HBase Create Table
- vim 语法高亮
- ibatis中 $ 于 # 的 区别?
- linux概述
- Android中如何给TextView添加下划线、设置不同字体和颜色
- 【DFS】HDU1241Oil Deposits
- Notification Once为AppDelegate瘦身
- DBCP连接池原理分析
- 九度oj1172 Huffman树(入门题)
- seekBar属性详解
- 基于scikit-learn工具的交叉检验 — cross_validation模型
- 一个故事讲清楚 NIO
- 初探Block
- 单调队列优化dp-----nkoj3662划区灌溉