UVA 572 Oil Deposits (简单BFS)
来源:互联网 发布:硬盘安装深度linux 编辑:程序博客网 时间:2024/05/19 01:33
Oil Deposits
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 containingm and n, the number of rows and columns in the grid, separated by a single space. Ifm = 0 it signals the end of the input; otherwiseand. Following this arem 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
题意:给出图。 @代表油田。@如果与周围8个方向有@相连。代表是同一片油田。要求出一共有几片油田
思路:很基础的BFS。一个个点找过去,找到@,就把与之8方向相连的@一整片变成*。油田数+1。
#include <stdio.h>#include <string.h>int i,j;int n, m;int d[8][2] = {-1, 0, 0, 1, 1, 0, 0, -1, -1, -1, 1, 1, 1, -1, -1, 1};char map[105][105];void bfs(int x, int y){int i;map[x][y] = '*';for (i = 0; i < 8; i ++){int xx = x + d[i][0];int yy = y + d[i][1];if (map[xx][yy] == '@' && xx >= 0 && xx < n && yy >= 0 && y < m){bfs(xx, yy);}}}int main(){while (scanf("%d%d", &n, &m) != EOF && n && m){int num = 0;getchar();for (i = 0; i < n; i ++)gets(map[i]);for (i = 0; i < n; i ++)for (j = 0; j < m; j ++){if (map[i][j] == '@'){bfs(i, j);num ++;}}printf("%d\n", num);}return 0;}
- UVA 572 Oil Deposits (简单BFS)
- UVA-572 Oil Deposits(BFS)
- uva 572 Oil Deposits(bfs实现)
- UVA Oil Deposits (BFS)
- UVa 572 - Oil Deposits (简单dfs)
- Oil Deposits - UVa 572 简单搜索
- UVA 572- Oil Deposits(简单dfs)
- uva 572 - Oil Deposits
- uva 572 - Oil Deposits
- uva 572 - Oil Deposits
- uva-572-Oil Deposits
- UVa 572 - Oil Deposits
- UVa 572 - Oil Deposits
- UVa 572 - Oil Deposits
- uva 572Oil Deposits
- UVa 572Oil Deposits
- UVa 572 - Oil Deposits
- UVa 572: Oil Deposits
- RAC 的一些概念性和原理性的知识 .
- 异常 中断上下文 内核抢占
- RAC 之 RMAN 备份
- 解决RAC 实例不能启动
- VB6基本数据库应用(五):数据的查找与筛选
- UVA 572 Oil Deposits (简单BFS)
- POJ 1502 MPI Maelstrom(spfa邻接矩阵)
- Hibernate.initialize(Object obj)
- DB2 sql 重点难点复习总结
- Oracle 单实例 迁移到 RAC 实例 -- 使用导出导入方法 .
- Oracle RAC 常用维护工具和命令 .
- JAVA异常处理机制
- 内核编译错误解答(elf_i386错误)
- 动态规划解最长公共子序列问题