Oil Deposits
来源:互联网 发布:如何搭建网络采购平台 编辑:程序博客网 时间:2024/05/16 07:59
Oil Deposits
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
Submit
Status
Practice
HDU 1241
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
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
Submit
Status
Practice
HDU 1241
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
2
#include <cstdio>#include <cstring>#include <queue>using namespace std;typedef struct pos{ int x, y;}pos;int h, l;int dir[8][2]={ {0,1},{1,0},{0,-1},{-1,0},{1,1},{1,-1},{-1,1},{-1,-1} };char ch[105][105];bool judge(pos x){ if(x.x<0||x.x>=h || x.y<0||x.y>=l || ch[x.x][x.y]=='*') return false; return true;}void bfs(int i, int j){ pos now, next; queue<pos>Q; now.x=i; now.y=j; ch[now.x][now.y] = '*'; Q.push(now); while( !Q.empty() ){ now=Q.front(); Q.pop(); for(int i=0; i<8; i++){ next.x=now.x+dir[i][0]; next.y=now.y+dir[i][1]; if(judge(next)){ ch[next.x][next.y]='*'; Q.push(next); } } }}int main(){ int ans; while( scanf("%d%d", &h,&l)!=-1 ){ if( h==0 || l==0 ) break; for(int i=0; i<h; i++){ scanf("%s",ch[i]); } ans = 0; for(int i=0; i<h; i++){ for(int j=0; j<l; j++){ if(ch[i][j]=='@'){ ans++; bfs(i, j); } } } printf("%d\n", ans); } return 0;}
0 0
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- Oil Deposits
- oil deposits
- Oil Deposits
- Oil Deposits
- mysql数据库 ibatis环境下column "username" not found问题
- 控制字符串
- [LeetCode] Median of Two Sorted Arrays
- tomcat缓存
- linux系统性能调优第一步——性能分析(vmstat)
- Oil Deposits
- make参数详解
- 斐波那契数列的几种实现与递归(Fibonacci Function and Recurrence)
- 利用fluentd构建分布式日志管理系统
- redis入门——redis常用命令
- 一种奇怪的字符串输出方法
- Application中弹出Dialog
- Android开源项目第一篇——个性化控件(View)篇
- 在Almel Studio6中如何定义一个数组到Flash寄存器