HDU 1241 Oil Deposits
来源:互联网 发布:微博数据抓取 编辑:程序博客网 时间:2024/06/03 22:02
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题目差不多,找下感觉,注意map[nx][ny]不要写错#include<iostream>#include<cstdio>#include<string>using namespace std;char map[105][105];int x[8]={0,0,-1,1,1,1,-1,-1};int y[8]={1,-1,0,0,-1,1,1,-1};int m,n;void dfs(int a,int b){ int i,j,nx,ny; map[a][b]='*'; for(i=0;i<8;i++) { nx=a+x[i],ny=b+y[i]; if(nx>=0&&nx<m&&ny>=0&&ny<n&&map[nx][ny]=='@') { dfs(nx,ny); } }}int main(){ int i,j,s; while(scanf("%d%d",&m,&n),m) { for(i=0;i<m;i++) for(j=0;j<n;j++) cin>>map[i][j]; s=0; for(i=0;i<m;i++) { for(j=0;j<n;j++) if(map[i][j]=='@') { dfs(i,j); s++; } } printf("%d\n",s); } return 0;}
0 0
- HDU 1241Oil Deposits
- HDU---1241Oil Deposits
- Hdu 1241 Oil Deposits
- Hdu 1241 - Oil Deposits
- HDU-1241:Oil Deposits
- hdu 1241 Oil Deposits
- hdu 1241 Oil Deposits
- hdu 1241 Oil Deposits
- hdu - 1241 - Oil Deposits
- HDU-1241Oil Deposits
- hdu 1241 Oil Deposits
- hdu 1241 Oil Deposits
- HDU 1241 Oil Deposits
- hdu 1241 Oil Deposits
- hdu 1241 Oil Deposits
- HDU 1241 Oil Deposits
- hdu-1241-Oil Deposits
- hdu 1241 Oil Deposits
- 安装 - FreeBSD + Nginx 环境搭建教程(推荐)
- Java Executors
- 我爱K歌软件 v1.6.6.4001 官方版
- dom4j教程学习
- 计算字符串长度(包括中英数字混合)
- HDU 1241 Oil Deposits
- 新浪show虚拟视频 v3.1 官方版
- 一个线程池的简单的实现
- 淘宝在hbase中的应用和优化
- Linux Wireless架构总结--wifi的数据通路
- projecteuler---->problem=6----Sum square difference
- 小月慌忙四处寻找小梅
- 配置applicationContext.xml
- LeetCode: Set Matrix Zeroes [073]