uva 572 Oil Deposits(bfs实现)
2015-08-21 11:25
399 查看
Oil DepositsTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld
& %llu
SubmitStatusPracticeUVA
572
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.
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
and
. 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.
& %llu
SubmitStatusPracticeUVA
572
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 containingm 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
and
. 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 分析:bfs连通块#include"cstdio" #include"iostream" #include"cstring" #include"cmath" #include"algorithm" #include"queue" #include"stack" using namespace std; const int maxn=104; int dic[8][2]={{0,1},{1,1},{1,0},{1,-1},{0,-1},{-1,-1},{-1,0},{-1,1}}; char map[maxn][maxn]; int vis[maxn][maxn]; int n,m; int num; void bfs(int c,int r){ queue<int> p; queue<int> q; p.push(c); q.push(r); while(!p.empty()){ int x=p.front(); int y=q.front(); p.pop(); q.pop(); for(int i=0;i<8;i++){ c=x+dic[i][0]; r=y+dic[i][1]; if(c>=0&&c<n&&r>=0&&r<m&&map[c][r]=='@'&&!vis[c][r]){ // map[x][y]='*'; vis[c][r]=1; p.push(c); q.push(r); } } } } int main(){ while(cin>>n>>m){ if(n==0&&m==0) break; memset(map,0,sizeof(map)); memset(vis,0,sizeof(vis)); for(int i=0;i<n;i++){ scanf("%s",map[i]); } num=0; for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ if(!vis[i][j]&&map[i][j]=='@'){ // map[i][j]='*'; vis[i][j]=1; bfs(i,j); num++; // cout<<i<<" "<<j<<endl; } } } cout<<num<<endl; } }
相关文章推荐
- html5图片裁剪控件原型【含缩放,旋转,拖动功能】---2、核心代码
- myeclipse 自动提示
- 单链表的创建和遍历
- 【Python】输出程序执行的百分比
- 搜索WKWebView[UIWebView]中内容
- iOS多线程技术
- C#调用WebService
- JAVA读取Oracle数据库BLOB字段数据文件并保存到本地文件
- 数据结构概念
- python基础三——面向对象
- 网站建立流程
- svn清理失败乱码问题执行语句
- git服务器的简单搭建
- android压缩图片的算法
- WPF和XAML
- 自定义View实现之健康指数监控器
- 不平衡分类问题处理方法
- putty GB2312 & BIG5 中文字符集补丁
- Java重写equals
- Xamarin.Android快速入门