HDU 1241 Oil Deposits【深搜练习】
来源:互联网 发布:子域名是否需要备案 编辑:程序博客网 时间:2024/05/29 18:33
Oil Deposits
Total Submission(s): 34993 Accepted Submission(s): 20305
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
2
题意概括:
当两个油田挨在一起时算作一块油田,统计共有多少块油田。
AC代码:
#include<stdio.h>#include<string.h>#define N 105char Map[N][N];int next[8][2] = {{0,1},{1,0},{0,-1},{-1,0},{-1,-1},{-1,1},{1,-1},{1,1}};int n, m;void dfs(int x, int y){ int tx, ty, i; Map[x][y] = '*'; for(i = 0; i < 8; i++){ tx = x + next[i][0]; ty = y + next[i][1]; if(Map[tx][ty] == '*' || tx >= n || ty >= m || tx < 0 || ty < 0) continue; dfs(tx, ty); }}int main(){ int i, j, con; while(scanf("%d%d", &n, &m), n){ for(i = 0; i < n; i++) scanf("%s", Map[i]); for(i = con = 0; i < n; i++){ for(j = 0; j < m; j++){ if('@' == Map[i][j]){ dfs(i, j); con++; } } } printf("%d\n", con); } return 0;}
- HDU 1241 Oil Deposits【深搜练习】
- 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
- 探究服务(二)--AsyncTask
- 设计模式之简单工厂模式
- 《21天实战caffe》 读书笔记(六)
- 虚函数
- vue组件
- HDU 1241 Oil Deposits【深搜练习】
- 文章标题
- UVa 202 Repeating Decimals 循环节
- 关于位运算(转需)
- 工具类注入Service
- 微信二次分享解决方案
- 做乘法
- JVM调优总结 -Xms -Xmx -Xmn -Xss
- Python基础之语句(条件、循环)