uva_572 - Oil Deposits

/* 题目大意：一块区域中分布着油田，连在一起就属于一个油田，求油田个数。* 也就是求一个无向图的连通分支个数，直接dfs8个方向，水过。。。
*/
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;#define MAX 101
#define DIR 8char a[MAX][MAX];
int visited[MAX][MAX];
int dir[][2] = {{-1, -1}, {-1, 0}, {-1, 1}, {0, -1},{0, 1}, {1, -1}, {1, 0}, {1, 1}
};void DFS(int x, int y){if( visited[x][y] || a[x][y] == '*' ) return ;visited[x][y] = 1;for(int i = 0; i < DIR; i ++)DFS(x+dir[i][0], y+dir[i][1]);
}int main(int argc, char const *argv[])
{
#ifndef ONLINE_JUDGEfreopen("test.in", "r", stdin);
#endifint m, n, ans;while( scanf("%d %d", &m, &n), m || n ){ans = 0;memset(a, '*', sizeof(a));memset(visited, 0, sizeof(visited));for(int i = 0; i < m; i ++){getchar();for(int j = 0; j < n; j ++){scanf("%c", &a[i][j]);}}for(int i = 0; i < m; i ++){for(int j = 0; j < n; j ++){if( a[i][j] == '@' && !visited[i][j] ){ans ++;DFS(i, j);}}}printf("%d\n", ans);}return 0;
}

uva_572 - Oil Deposits相关推荐

L - Oil Deposits HDU - 1241
L - Oil Deposits HDU - 1241 注意写check的时候要先判x,y是不是越界了,不然直接用数组可能RE, 也可能直接WA了 #include<cstdio> #in ...
UVa572 Oil Deposits DFS求连通块
技巧:遍历8个方向 for(int dr = -1; dr <= 1; dr++)for(int dc = -1; dc <= 1; dc++)if(dr != 0 || dc != 0) ...
HDU-1241 Oil Deposits (DFS)
Oil Deposits Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other) Total ...
【POJ - 1562】Oil Deposits （dfs搜索，连通块问题）
题干: The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. G ...
【HDU - 1241】Oil Deposits （连通块问题属于求大海中的岛屿个数类似问题）
题干: The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. G ...
L - Oil Deposits
题目描述 The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. ...
NUC1397 Oil Deposits【DFS】
Oil Deposits 时间限制: 1000ms 内存限制: 65535KB 问题描述 The GeoSurvComp geologic survey company is responsible ...
百-寒-进-16-油田Oil Deposits
Oil Deposits 题目描述 GeoSurvComp地质调查公司负择探测地下石油矿床.该公司一次处理一个大的矩形区域,并创建一个网格,将土地划分为许多正方形地块.然后,它分别分析每个地块,使用传 ...
HDU 1241 Oil Deposits
题目大意是找到独立的油田个数,所谓独立就是跟它相邻的八个方向上都不能再有别的油田.思路就是每遇到一个'@'都要将它周围的所有'@'都给改成'*',用DFS跟BFS都可以,这里是DFS的代码: AC c ...
UVA572 Oil Deposits DFS求解
小白书上经典DFS题目. 1. 递归实现 // from: https://www.cnblogs.com/huaszjh/p/4686092.html#include <stdio.h> ...

uva_572 - Oil Deposits

uva_572 - Oil Deposits相关推荐

最新文章

热门文章