UVa 572 Oil Deposits(DFS)
2015-12-14 19:19
561 查看
Oil Deposits |
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
and
.
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 depositwill not contain more than 100 pockets.
Sample Input
1 1 * 3 5 *@*@* **@** *@*@* 1 8 @@****@* 5 5 ****@ *@@*@ *@**@ @@@*@ @@**@ 0 0
Sample Output
0 1 2 2
题意 计算@连通块的数量 典型的dfs应用
#include<cstdio> #include<cstring> using namespace std; #define r i+x[k] #define c j+y[k] const int N = 105; char mat ; int n, x[8] = { -1, -1, -1, 0, 0, 1, 1, 1}; int m, y[8] = { -1, 0, 1, -1, 1, -1, 0, 1}; int dfs (int i, int j) { if (mat[i][j] == '*') return 0; mat[i][j] = '*'; for (int k = 0; k < 8; ++k) if (r > 0 && r <= n && c > 0 && c <= m && mat[r][c] == '@') dfs (r, c); return 1; } int main() { while (scanf ("%d%d", &n, &m), n) { int ans = 0; for (int i = 1; i <= n; ++i) scanf ("%s", mat[i] + 1); for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) ans += dfs (i, j); printf ("%d\n", ans); } return 0; }
相关文章推荐
- [AngularJS] Services, Factories, and Providers -- value & Providers
- STM32 ucLinux环境搭建
- 基于Emma的独立测试用例代码覆盖率统计
- margin-bottom与bottom不同
- UNIX网络编程卷1 server编程范式0 迭代server
- MATLAB GUI程序设计中使文本框接收多行输入的方法
- 【iCore3 双核心板】例程十三:SDIO实验——读取SD卡信息
- 第八周项目2 建立链串的算法库
- xcode7打包生成ipa包
- mscomm缺失、注册问题
- POJ_P1511 Invitation Cards(单源最短路+SPFA)
- 从netty-example分析Netty组件
- 开脑洞学编程之面向对象
- EasyUI 多行动态选择性合并算法实现
- vfork()函数
- 模型选择准则
- iOS之如何自适应TableViewCell的高度
- 开脑洞学编程之序章
- python之装饰器详解
- PHP number_format()函数