-----hdu 1241 dfs
来源:互联网 发布:windows assembly 编辑:程序博客网 时间:2024/04/30 03:45
Oil Deposits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 29278 Accepted Submission(s): 16894
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
0
1
2
2
#include <iostream>#include <algorithm>#include <cstring>#include <cstdio>using namespace std;char a[110][110];int t[8][2]={{1,0},{0,1},{-1,0},{0,-1},{1,1},{-1,-1},{1,-1},{-1,1}};/一共八个方向int n,m;int vis[110][110];void dfs(int i,int j){ vis[i][j]=1;/将已经查询过的方格做上标记 for(int k=0;k<8;k++)/八个方向 { int x=i+t[k][0]; int y=j+t[k][1]; if(x>=0&&y>=0&&x<n&&y<m&&vis[x][y]==0&&a[x][y]=='@')/如果该方格没有越界,并且该方格没有被查询过,并且该方格有油带 dfs(x,y); } return;}int main(){ while(cin>>n>>m&&n&&m) { memset(vis,0,sizeof(vis)); for(int i=0;i<n;i++) for(int j=0;j<m;j++) cin>>a[i][j]; int ans=0; for(int i=0;i<n;i++) for(int j=0;j<m;j++) if(a[i][j]=='@'&&vis[i][j]==0) { ans++; dfs(i,j); } cout<<ans<<endl; }}
- 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)
- 牛客网-连续整数
- 一个简单的随机点名器。
- Cross-Validation概述
- pcl 中的 kd-tree
- URAL
- -----hdu 1241 dfs
- centos mysql 数据库连接失败
- 怎么修改代码能实现TXT文件的操作
- CSS--cursor光标属性
- android读书应用翻页时自动回到前一页
- Python Optparse篇
- 基于SSH架构的论坛,用了继承映射,怎么实现按最新回复排序
- Android Studio 引入Jar包,Jar包冲突问题总结
- dreamweaver中如何控制点击铵钮后的动作