HDU 1241 Oil Deposits
2015-02-19 16:51
337 查看
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 eachplot 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. Followingthis 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 判断@联通图的个数,直接dfs标记即可。#include<stdio.h> #include<string.h> int n, m, k; char s[101][101]; int flag[101][101]; int a[] = { 0, -1, -1, -1, 0, 0, 1, 1, 1 }; int b[] = { 0, -1, 0, 1, -1, 1, -1, 0, 1 }; void dfs(int x, int y, int z) { for (int i = 1; i <= 8; i++) { int xx = x + a[i], yy = y + b[i]; if (xx > 0 && xx <= n&&yy >= 0 && yy < m&&s[xx][yy]=='@'&&flag[xx][yy]==0) { flag[xx][yy] = z; dfs(xx, yy, z); } } } int main() { while (scanf("%d%d", &n, &m) != EOF&&n != 0) { memset(flag, 0, sizeof(flag)); k = 0; for (int i = 1; i <= n; i++) scanf("%s", s[i]); for (int i = 1; i <= n; i++) for (int j = 0; j < m; j++) if (s[i][j] == '@'&&flag[i][j] == 0) { flag[i][j] = ++k; dfs(i, j, k); } printf("%d\n", k); } return 0; }
相关文章推荐
- HDU 1241 Oil Deposits DFS无回溯 求油田的个数
- Problem K:Oil Deposits(HDU 1241)
- HDU 1241 Oil Deposits(递归,搜索)
- HDU 1241 Oil Deposits
- hdu1241 Oil Deposits
- HDU 1241 Oil Deposits(dfs入门级别模板题)
- HDU 1241 Oil Deposits(八连块问题) 与 黑白图像(刘汝佳的小白6.4.1)同样的原理(DFS)
- HDU 1241 Oil Deposits(DFS)
- DFS-HDU-1241-Oil Deposits
- HDU - 1241 Oil Deposits
- HDU Problem 1241 Oil Deposits 【DFS】
- hdu 1241 (Oil Deposits)
- hdu 1241 Oil Deposits 解题报告
- HDU 1241 Oil Deposits (水水的一道搜索题,我的搜索由此启程)
- hdu 1241 Oil Deposits (DFS)(BFS)
- HDU 1241 Oil Deposits
- HDU 1241 Oil Deposits(DFS模板题)
- HDU 1241 Oil Deposits(dfs)
- HDU 【1241】Oil Deposits(DPS)
- HDU 1241 -- Oil Deposits (dfs)