POJ 1562-Oil Deposits(BFS)
来源:互联网 发布:arp绑定mac 编辑:程序博客网 时间:2024/05/22 02:11
Oil Deposits
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 12621 Accepted: 6888
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 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
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
012遇到@就搜(广搜深搜都可以)8个方向把相邻的@清掉
#include <iostream>#include <cstdio>#include <cstring>#include <vector>#include <queue>#include <algorithm>using namespace std;typedef struct node{int x,y;node (int a,int b){x=a;y=b;}};int mv[8][2]={{0, 1}, {0, -1}, {1, 0}, { -1, 0},{-1,-1},{-1,1},{1,-1},{1,1}};char ma[110][110];int m, n, ans;void bfs(int x,int y){ma[x][y]='*';queue <node> Q;Q.push(node(x,y));while(!Q.empty()){node v=Q.front();Q.pop();if(ma[v.x][v.y]=='@')ma[v.x][v.y]='*';for(int i=0;i<8;i++){int tx=v.x+mv[i][0];int ty=v.y+mv[i][1];if(tx>=0&&tx<m&&ty>=0&&ty<n&&ma[tx][ty]=='@'){ma[tx][ty]='*';Q.push(node(tx,ty));}}}}int main(){int i;while (cin >> m >> n){if (!m && !n){break;}getchar();for (i = 0; i < m; i++){cin >> ma[i];}ans=0;for(int i=0;i<m;i++)for(int j=0;j<n;j++)if(ma[i][j]=='@') { bfs(i,j); ans++; }cout<<ans<<endl;}return 0;}
0 0
- POJ 1562-Oil Deposits(BFS)
- poj 1562Oil Deposits( BFS DFS)
- POJ 1562/HDU 1241 Oil Deposits(BFS)
- Oil Deposits(POJ 1562)
- poj 1562 Oil Deposits
- POJ 1562 Oil Deposits
- poj 1562 Oil Deposits
- poj 1562 Oil Deposits
- poj-1562Oil Deposits
- POJ-1562-Oil Deposits
- POJ 1562 Oil Deposits
- POJ 1562 Oil Deposits
- POJ 1562 Oil Deposits
- POJ 1562 Oil Deposits
- poj 1562 Oil Deposits
- poj 1562 Oil Deposits
- POJ:1562 Oil Deposits
- poj 1562 Oil Deposits
- hdu 1276 士兵队列训练问题
- JQuery总结
- Ice
- ubuntu下使用Eclipse搭建Hadoop开发环境
- 微信知识_微信语音消息如何导出
- POJ 1562-Oil Deposits(BFS)
- axis2+spring+Hibernate webservice 非aar方式
- java System.arraycopy(b, 0, s, 2, 3);
- UML箭头表示
- hdu4547——CD操作 LCA在线算法
- extjs学习05——extjs的初级UI设计2
- IOS 基于AV Foundation框架开发简单音乐播放器
- 解析的几种方式
- Spring基于ThreadLocal的“资源-事务”线程绑定设计