hdu 1241 Oil Deposits
来源:互联网 发布:淘宝服装图片素材 编辑:程序博客网 时间:2024/06/06 19:05
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
0
1
2
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
0
1
2
2
感觉自己写的这个题有毛病,最后一组样例根本就不对,但还是ac了,在网上看了看其他人写的,运行结果也是最后一个事例不对,郁闷呀
#include<stdio.h>#include<string.h>#include <string>#include <queue>#include <iostream>using namespace std;char map[103][103];int dir[8][2]={1,0,0,1,-1,0,0,-1,1,1,-1,-1,1,-1,-1,1};int m,n,cnt;void dfs(int x,int y){ for (int i=0;i<8;i++) { int ax=x+dir[i][0]; int ay=y+dir[i][1]; if (ax<m&&ax>=0&&ay<n&&ay>=0&&map[ax][ay]=='@') { map[ax][ay]='*'; dfs(ax,ay); } }}int main(){ int i,j,px,py; while (~scanf("%d%d",&m,&n),m+n) { int cnt=0; for (i=0;i<m;i++) { getchar(); for (j=0;j<n;j++) scanf("%c",&map[i][j]); } for (i=0;i<m;i++) for (j=0;j<n;j++) if (map[i][j]=='@') { cnt++; map[i][j]='*'; dfs(i,j); } printf("%d\n",cnt); } 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
- GDOI'2016市选day1 —— 3. 最大值求和 (summax)
- 做个毕设也不容易之购物车模块遇到java.lang.IllegalArgumentException
- RMI、RPC、SOAP通信技术介绍及比对
- cmake指令记录
- java动态代理技术
- hdu 1241 Oil Deposits
- 按钮的toucheBegin和按钮的监听事件有冲突
- PLSQL Developer安装、tnsnames.ora配置 解答
- JavaWeb - Http协议
- codeforces 143 C.To Add or Not to Add (YY 二分 处理一下前缀和)
- 蛇形矩阵(百度2016实习招聘)
- Tensorflow 官方版教程中文版
- 迁移postgres数据库
- AQS(5):ReentrantLock