探查油田——广度搜索
来源:互联网 发布:循环大批量更新数据库 编辑:程序博客网 时间:2024/05/16 06:18
/*1562:Oil Deposits 总时间限制: 1000ms 内存限制: 65536kB描述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.输入The input 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.输出are adjacent horizontally, vertically, or diagonally. An oil deposit will not contain more than 100 pockets.样例输入1 1*3 5*@*@***@***@*@*1 8@@****@*5 5****@*@@*@*@**@@@@*@@@**@0 0样例输出0122来源Mid-Central USA 1997广度搜索,设置节点队列,8个方向搜索清空队列、初始化队列队首元素探查后出队检查入队元素是否在地图内一个元素入队时应作标记 */#include<iostream>#include<cstdio>#include<cstring>using namespace std;#define _N 100struct Node{int x,y;Node(){};Node(int x_,int y_):x(x_),y(y_){};bool isInMap(int m,int n){return x < m && x >= 0 && y < n && y >= 0;}}que[_N*_N];int queHead,queTail;char mat[_N][_N];bool vis[_N][_N];int m,n;int dx[] = {-1, -1, -1, 0, 0, 1, 1, 1};int dy[] = {-1, 0, 1, -1, 1, -1, 0, 1};void bfs(int x, int y, int m, int n) { queHead = queTail = 0; // 清空队列 // 将(x, y)加入队列 que[queTail++] = Node(x, y); vis[x][y] = true; // 开始BFS搜索 for (; queHead < queTail; ++queHead) { // 探查队首元素周围的8个位置 for (int i = 0; i < 8; ++i) { // 根据偏移量计算位置 Node nxt(que[queHead].x + dx[i], que[queHead].y + dy[i]); // 若该位置在地图中且为未访问过的'@',则加入队列 if (nxt.isInMap(m, n) && !vis[nxt.x][nxt.y] && mat[nxt.x][nxt.y] == '@') { que[queTail++] = nxt; vis[nxt.x][nxt.y] = true; } } }}int main(){while(cin >> m >> n){int ret = 0;if(m == 0)break;for(int i = 0; i < m ;++i)for(int j = 0; j < n; ++j)cin >> mat[i][j];memset(vis, 0, sizeof(vis)); // 初始化标记// 遍历整个地图for (int i = 0; i < m; ++i) {for (int j = 0; j < n; ++j) {// 探查到了一个油矿if (mat[i][j] == '@' && !vis[i][j]){bfs(i, j, m, n);ret++;}}}cout << ret << endl;}}
/*递归版本,对于每个@的位置进行8个方向搜索,如果发现@将其标记继续搜索 */#include<iostream>#include<cstdio>#include<cstring>using namespace std;char mat[101][101];bool vis[101][101];int m,n;int dx[] = {-1, -1, -1, 0, 0, 1, 1, 1};int dy[] = {-1, 0, 1, -1, 1, -1, 0, 1};void bfs(int x,int y){if(x < 0 || x >= m || y < 0 || y >= n)return;vis[x][y] = true;for(int i = 0; i < 8; ++i){if(!vis[x+dx[i]][y+dy[i]] && mat[x+dx[i]][y+dy[i]] == '@')bfs(x+dx[i],y+dy[i]);}}int main(){while(cin >> m >> n){int ret = 0;if(m == 0)break;for(int i = 0; i < m ;++i)for(int j = 0; j < n; ++j)cin >> mat[i][j];memset(vis, 0, sizeof(vis)); // 初始化标记// 遍历整个地图for (int i = 0; i < m; ++i) {for (int j = 0; j < n; ++j) {// 探查到了一个油矿if (mat[i][j] == '@' && !vis[i][j]){bfs(i, j);ret++;}}}cout << ret << endl;}}
0 0
- 探查油田——广度搜索
- 基础搜索题——油田合并(深度搜索)
- poj2386——油田问题(简单搜索)
- 搜索——广度优先搜索
- 广度优先搜索——字符串替换
- 迷宫——广度优先搜索
- BFS广度优先搜索——入门
- 广度优先搜索——01迷宫
- 广度优先搜索——BFS遍历
- 图——广度优先搜索(Graph
- 广度优先搜索算法—BFS
- HDU-Oil Deposits-油田搜索
- Oil Deposits——在图中找油田
- 广度搜索——分酒问题(最优解)
- 广度优先搜索BFS——图邻接表表示
- 广度优先搜索BFS——图邻接矩阵表示
- 图搜索——深度优先与广度优先
- 数据结构——图的邻接矩阵的广度优先级搜索
- LeetCode: Climbing Stairs [070]
- VmodCAM 初始化
- 结构体输入姓名,年龄,性别。你猜我写的对不对??
- J2EE学习篇之--Spring技术详解
- Scripts:dump nclob列的脚本(慎用)lob_dump_nclob.sql
- 探查油田——广度搜索
- java程序员必知的8大排序
- Java Swing界面编程(12)---JPanel布局
- Scripts:dump clob列内容的脚本(慎用)lob_dump_clob.sql
- LeetCode N-Queens II
- week14 清空行
- 链表常见操作:逆置(反转) .
- pangDiJlA诒稚勺桓巳柏彼
- Scripts:dump blob列内容的脚本(慎用)lob_dump_blob.sql