HDU 1241 Oil Deposits
来源:互联网 发布:手机版特效软件 编辑:程序博客网 时间:2024/06/04 18:40
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
0122
判断@联通图的个数,直接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;}
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
- MVC框架设计思想与设计理念
- 【转】在TCL中安装非市场应用
- Mac下使用SAE的问题们
- my—review-2014
- 【Uva 340】 Master-Mind Hints
- HDU 1241 Oil Deposits
- UVA 1197 The Suspects
- 技术管理的核心内容: 提高团队技能
- 打印队列(Printer Queue)
- 欢迎使用CSDN-markdown编辑器
- Clone Graph
- HDU 1829 A Bug's Life
- 【android】类似微信底部按钮标签实现
- HDU 1253 胜利大逃亡