HDOJ 1241Oil Deposits(BFS)
来源:互联网 发布:双系统安装教程linux 编辑:程序博客网 时间:2024/05/20 13:18
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//// main.cpp// Oil Deposits//// Created by 张嘉韬 on 16/3/25.// Copyright © 2016年 张嘉韬. All rights reserved.//#include <iostream>#include <cstring>using namespace std;int m,n,map[110][110],counter;int dx[]={-1,-1,-1,0,0,1,1,1};int dy[]={-1,0,1,-1,1,-1,0,1};int safe(int x,int y){ int flag=1; if(x<=0||x>m||y<=0||y>n||map[x][y]==0) flag=0; return flag;}struct node{ int x; int y;}nodes[10010];void bfs(int x,int y){ int head,tail; head=tail=1; nodes[tail].x=x; nodes[tail].y=y; tail++; map[x][y]=0; while(head<tail) { int tempx,tempy; for(int i=0;i<8;i++) { tempx=nodes[head].x+dx[i]; tempy=nodes[head].y+dy[i]; if(safe(tempx,tempy)==1) { nodes[tail].x=tempx; nodes[tail].y=tempy; map[tempx][tempy]=0; tail++; } } head++; }}int main(int argc, const char * argv[]) { //freopen("/Users/zhangjiatao/Desktop/input.txt","r",stdin); while(scanf("%d%d",&m,&n)==2) { if(m==0&&n==0) return 0; for(int i=1;i<=m;i++) { for(int j=1;j<=n;j++) { char temp; cin>>temp; if(temp=='@') map[i][j]=1; else map[i][j]=0; } } counter=0; for(int i=1;i<=m;i++) { for(int j=1;j<=n;j++) { if(map[i][j]==1) { bfs(i,j); counter++; } } } cout<<counter<<endl; } return 0;}
0 0
- HDOJ 1241Oil Deposits(BFS)
- HDOJ 1241Oil Deposits(BFS)
- HDOJ 1241Oil Deposits(BFS)
- hdoj 1241 Oil Deposits
- hdoj 1241 Oil Deposits
- HDOJ 1241 Oil deposits
- HDOJ 1241 Oil Deposits
- HDOJ 1241 Oil Deposits
- HDOJ 1241 Oil Deposits
- hdoj 1241 Oil Deposits
- hdoj 1241 Oil Deposits
- hdoj 1241 Oil Deposits
- hdoj 1241 Oil Deposits
- hdoj-1241-Oil Deposits
- HDOJ-1241 Oil Deposits
- HDOJ - 1241 Oil Deposits
- hdoj-1241【Oil Deposits】
- hdoj 1241 Oil Deposits
- Java switch不支持使用字符串对象
- IO中同步、异步与阻塞、非阻塞的区别
- ROS下使用intel Realsense摄像头进行人脸检测
- 关于iOS的due to uncaught exception 'CALayerInvalidGeometry'错误
- Android的开源框架Android-Universal-Image-Loader的基本介绍
- HDOJ 1241Oil Deposits(BFS)
- Android起步之布局(1)LinearLayout
- 客户端缓存和服务器缓存处理
- 练习4:变量
- C语言实现顺序表
- 2.Java IO教程--概览
- xcode7-- 创建pch宏 与安装cocoapods
- onethink修改后台的团队信息等内容
- ZYThumbnailTableView---堪比一个小型阅读App