HDU 1241 DFS
来源:互联网 发布:原来在淘宝上买的基金 编辑:程序博客网 时间:2024/05/16 19:53
Oil Deposits
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
题意:找出有几部分'@', dfs即可求解
代码:
#include <iostream>using namespace std;int dire[8][2]={{0,1},{0,-1},{1,0},{-1,0},{1,1},{1,-1},{-1,1},{-1,-1}};int a,b;int cnt;//记录总数char map[101][101];//邻接矩阵void dfs(int x,int y)//深搜{int xx,yy,i;for(i=0;i<8;i++)//八个方向寻找{xx=x+dire[i][0];yy=y+dire[i][1];if(xx<0||xx>=a||yy<0||yy>=b)//判断越界continue;if(map[xx][yy]=='*')continue;map[xx][yy]='*';//找到之后,讲'@'变为'*'dfs(xx,yy);}}int main(){int i,j;while(scanf("%d%d",&a,&b)&&(a||b)){cnt=0;for(i=0;i<a;i++)scanf("%s",map[i]);for(i=0;i<a;i++){for(j=0;j<b;j++)if(map[i][j]=='@'){dfs(i,j);cnt++;}}printf("%d\n",cnt);}return 0;}
- HDU 1241 DFS
- hdu 1241 DFS
- hdu 1241 经典DFS
- hdu 1241 (dfs)
- HDU 1241 DFS
- hdu 1241(dfs)
- hdu 1241 简单dfs
- hdu 1241--入门DFS
- hdu 1241 dfs染色
- hdu 1241 dfs
- HDU 1241 DFS--分块
- HDU 1241 DFS算法
- 图论 DFS HDU 1241
- HDU 1241(DFS)
- HDU 1241 DFS经典
- -----hdu 1241 dfs
- HDU--1241 简单DFS
- HDU 1241(DFS)
- 从truncate表的hang现象引出来的oracleBUG 13023854
- CentOS 的shutdown不能用~~ command not found
- 使用WDK编译环境编译应用程序build命令(动态库程序)
- EL表达式中fn函数
- 换包的风险-mybatis
- HDU 1241 DFS
- 从0开始学习quantum之2:WSGI协议
- hdu 1016 Prime Ring Problem(DFS)
- 时钟
- 得到java异常printStackTrace的详细信息
- Android4.0内存Dex数据动态加载技术
- 动态规划(4)最大连续子串问题
- C/C++中static关键字详解
- Entity Framework 数据部分更新之Attach &&Detach