hud1241-DFS求连通块
来源:互联网 发布:破解音乐付费软件 编辑:程序博客网 时间:2024/05/09 06:44
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>
using namespace std;
char oil[101][101];
int m,n;
void dfs(int x,int y)
{
oil[x][y]='*';
int dx,dy;
int xx,yy;
for(dx=-1;dx<2;dx++)
for(dy=-1;dy<2;dy++)
{
xx=x+dx;
yy=y+dy;
if(xx>=0&&xx<m&&yy>=0&&yy<n&&oil[xx][yy]=='@')
{
dfs(xx,yy) ;
}
}
}
int main()
{
int i,j,ans=0;
while(cin>>m>>n&&m!=0)
{
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
cin>>oil[i][j];
}
}
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
if(oil[i][j]=='@')
{
dfs(i,j);
ans++;
}
}
}
cout<<ans<<endl;
ans=0;
}
return 0;
}
代码注意事项 注意边界情况,以及递归调用出口。
搜索入门题,深搜@,深搜次数即为所求联通块个数
代码如下:
#include<iostream>
using namespace std;
char oil[101][101];
int m,n;
void dfs(int x,int y)
{
oil[x][y]='*';
int dx,dy;
int xx,yy;
for(dx=-1;dx<2;dx++)
for(dy=-1;dy<2;dy++)
{
xx=x+dx;
yy=y+dy;
if(xx>=0&&xx<m&&yy>=0&&yy<n&&oil[xx][yy]=='@')
{
dfs(xx,yy) ;
}
}
}
int main()
{
int i,j,ans=0;
while(cin>>m>>n&&m!=0)
{
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
cin>>oil[i][j];
}
}
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
if(oil[i][j]=='@')
{
dfs(i,j);
ans++;
}
}
}
cout<<ans<<endl;
ans=0;
}
return 0;
}
代码注意事项 注意边界情况,以及递归调用出口。
1 0
- hud1241-DFS求连通块
- 用DFS求连通块
- 用DFS求连通块
- C++ DFS求连通块
- DFS求连通块(UVa 572)
- HDU1241 DFS/BFS 求连通块
- 畅通工程(DFS求连通块)
- dfs求连通块(围棋 poj)
- HDU 1241 dfs求连通块个数
- HDU1241(DFS求连通块)
- hdu 1241 dfs求连通块
- UVa 572 Oil Deposits(DFS求8连通块)
- UVA572 POJ1562 oil deposits(DFS求连通块问题)
- UVA 572 Oil Deposits dfs求连通块
- poj 1111 dfs(求连通块周长)
- POJ 2386(DFS 求连通块数量)
- AOJ 0118 Property Distribution(dfs 求连通块)
- UVa - 572 - Oil Deposits(dfs求连通块)
- 简单的心电图
- android反编译
- python使用@property @x.setter @x.deleter
- 适合小白的重装系统方式
- protobuf android ndk makefile
- hud1241-DFS求连通块
- Mac Osx下腾讯云centos7.2配置
- java之线程安全的单例类和文件拷贝
- 求助: thinkpad x1 carbon 4th 2016 版 安装ubuntu 14.04 问题?
- java 注解的使用
- Python3 Xlrd 读取EXCEL 操作笔记
- JavaScript 数组处理方法总结
- ztree 点击节点刷新jpGird表格
- js隐式转换:递增和递减操作符