http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=709
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
统计油田个数。 由于8个方向。实际上可以在读入数据的时候只对左上四个方向进行 合并。 因为后面的也会合并上面的。
这个也可用DFS深度优先遍历做。个人觉得效率要低点。
#include <iostream>
using namespace std;
int father[10001]; //把二维转化为1维,使用并查集
char map[101][101]; //
void init(int len) {
for (int i = 0; i <= len; i++)
father[i] = i;
}
int find_set(int i) {
if (i != father[i]) {
father[i] = find_set(father[i]);
}
return father[i];
}
void join(int x, int y) {
int i = find_set(x);
int j = find_set(y);
if (i != j)
father[i] = father[j];
}
//只用查找左上四个方向就行了(后面的还为读取到)
int dir[4][2] = { { -1, 0 }, { -1, -1 }, { 0, -1 }, { 1, -1 } };
int main() {
int m, n;
//m为列 n为行
while (cin >> m >> n) {
if (m == 0)
break;
init(m * n); //初始化并查集
//cout << find_set(2) << endl;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
// scanf("%c",&map[i][j]);
cin >> map[i][j];
// cout << map[i][j];
int tempj, tempi;
//如果当前读入为 @, 就和左上比较,可以加入一个集合
if (map[i][j] == '@') {
for (int k = 0; k < 4; k++) {
tempj = j + dir[k][0];
tempi = i + dir[k][1];
if (tempi >= 0 && tempi < m && tempj >= 0
&& tempj < n) {
//可以加入一个集合
if (map[tempi][tempj] == '@') {
join(i*n + j, tempi * n + tempj);
}
}
}
} else {
father[i*n + j] = -1; //后面要统计并查集的集合。 设为-1不统计没有油田的位置
}
}
}
//查找有几个集合
int cnt = 0;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
int index = i*n + j;
if (map[i][j] == '@' && father[index] != -1 && find_set(index) == (index)){
cnt ++;
}
}
}
cout << cnt << endl;
}
return 0;
}
分享到:
相关推荐
poj2492 A Bug's Life并查集应用的扩展,希望可以给大家带来用处
POJ 1988 并查集。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。
这份代码用C++实现了经典算法并查集,来源于poj题目1182
并查集基础 acm 算法 poj oi 并查集基础.ppt
poj 1611 The Suspects 代码 并查集的应用
NULL 博文链接:https://128kj.iteye.com/blog/1754177
POJ1089 并查集可以解决 并查集加路径压缩
数据结构并查集的相关资料,包括几篇并查集的论文,还有POJ上面几道关于并查集的题目的源代码
POJ分类POJ分类POJ分类POJ分类POJ分类POJ分类POJ分类POJ分类POJ分类POJ分类POJ分类POJ分类POJ分类POJ分类POJ分类POJ分类POJ分类POJ分类
NULL 博文链接:https://128kj.iteye.com/blog/1753387
NULL 博文链接:https://128kj.iteye.com/blog/1749213
NULL 博文链接:https://128kj.iteye.com/blog/1744222
NULL 博文链接:https://128kj.iteye.com/blog/1740501
poj 解题报告poj 解题报告poj 解题报告poj 解题报告poj 解题报告poj 解题报告poj 解题报告poj 解题报告poj 解题报告poj 解题报告poj 解题报告poj 解题报告poj 解题报告poj 解题报告poj 解题报告poj 解题报告poj 解题...
NULL 博文链接:https://128kj.iteye.com/blog/1733777
NULL 博文链接:https://128kj.iteye.com/blog/1754170
NULL 博文链接:https://128kj.iteye.com/blog/1744555
poj分类poj分类poj分类poj分类
NULL 博文链接:https://128kj.iteye.com/blog/1746750
POJ第1861题源码 POJ第1861题源码 POJ第1861题源码