uva 572 Oil Deposits
来源:互联网 发布:圆方软件论坛 编辑:程序博客网 时间:2024/05/19 15:41
题目:Oil Deposits
题意:给出地图,求有多少块连在一起的油田。横着竖着斜着相邻的算一块。
思路:dfs找联通块。
代码:
#include<cstdio>#include<iostream>#include<string>#include<cstring>using namespace std;int n,m;char a[105][105]= {0};bool use[105][105]= {0};int sum=0;int M1[9]={0, 0,1,1, 1,-1,-1,-1};int M2[9]={1,-1,0,1,-1, 0, 1,-1};void init() {sum=0;memset(a,0,sizeof(a));memset(use,0,sizeof(use));for(int i=0; i<n; i++) {scanf("%s",a[i]);}}void dfs(int x,int y){use[x][y]=true;for(int i=0;i<8;i++){int x_=x+M1[i],y_=y+M2[i];if(0<=x_&&x_<n&&0<=y_&&y_<m&&a[x_][y_]=='@'&&!use[x_][y_]) dfs(x_,y_);}}int main() {while(scanf("%d%d",&n,&m)==2&&n!=0) {init();for(int i=0;i<n;i++){for(int j=0;j<m;j++){if(a[i][j]=='@'&&!use[i][j]) {sum++;dfs(i,j);}}}printf("%d\n",sum);}return 0;}
阅读全文
2 0
- uva 572 - Oil Deposits
- uva 572 - Oil Deposits
- uva 572 - Oil Deposits
- uva-572-Oil Deposits
- UVa 572 - Oil Deposits
- UVa 572 - Oil Deposits
- UVa 572 - Oil Deposits
- uva 572Oil Deposits
- UVa 572Oil Deposits
- UVa 572 - Oil Deposits
- UVa 572: Oil Deposits
- uva 572 Oil Deposits
- UVa 572 - Oil Deposits
- uva 572 oil Deposits
- uva 572 - Oil Deposits
- uva 572 - Oil Deposits
- UVa 572 - Oil Deposits
- UVA 572 Oil Deposits
- Wordpress解析系列之PHP编写hook钩子原理简单实例
- jq里面关于单选按钮 type="radio" 判断最优处理方法
- 微信红包随机生成算法(PHP版)
- 无法启动iis express web 服务器
- SpringMVC学习之JSTL格式化行为
- uva 572 Oil Deposits
- 使用Mybatis-Generator自动生成Dao、Model、Mapping相关文件
- [leetcode]145. Binary Tree Postorder Traversal@Java解题报告
- 快速打开cmd的方法(win7)
- Google/LintCode:M-超级丑数
- hdu 6053-莫比乌斯反演
- 闭包
- [thinkPHP5项目实战_03]子命名空间及命名空间的访问方式
- ArrayList源码分析