kuangbin带你飞:专题一 简单搜索 L
来源:互联网 发布:java 时间转时间戳 编辑:程序博客网 时间:2024/05/21 09:13
kuangbin带你飞:专题一 简单搜索
L - 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 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
题意就是上下左右和四个对角线方向都算可连通的,那么求解强连通分量个数。由于这一题是地图的形式,我的想法是对于每个点BFS,前提是它没有被之前的点BFS后标记掉,将满足执行BFS的点的个数数一遍就代表了强连通分量的个数。
#include<bits/stdc++.h>using namespace std;const int siz=102;char maps[siz][siz];bool vis[siz][siz];int dir[8][2]={ 1,0, 0,1, -1,0, 0,-1, -1,-1, 1,1, 1,-1, -1,1 };struct node{ int x ,y;};vector <node> rec;int m,n;bool judge(int x,int y){ if(x>=0&&x<m&&y>=0&&y<n&&maps[x][y]=='@') { return 1; } return 0;}void bfs(node ans){ queue <node> q; q.push(ans); vis[ans.x][ans.y]=1; while(!q.empty()) { node tem=q.front(); q.pop(); int nx=tem.x; int ny=tem.y; for(int i=0;i<8;i++) { if(judge(nx+dir[i][0],ny+dir[i][1])&&!(vis[nx+dir[i][0]][ny+dir[i][1]])) { vis[nx+dir[i][0]][ny+dir[i][1]]=1; // cout<<"mark :"<<nx+dir[i][0]<<" "<<ny+dir[i][1]<<endl; node neo; neo.x=nx+dir[i][0]; neo.y=ny+dir[i][1]; q.push(neo); } } }}void clean(){ while(!rec.empty()) { rec.pop_back(); }}int main(){ while(cin>>m>>n&&m) { memset(vis,0,sizeof vis); clean(); for(int i=0;i<m;i++) { for(int j=0;j<n;j++) { cin>>maps[i][j]; if(maps[i][j]=='@') { node tem; tem.x=i; tem.y=j; rec.push_back(tem); } } } int len=rec.size(); int cnt=0; //cout<<"len :"<<len<<endl; for(int i=0;i<len;i++) { node ans=rec[i]; if(!vis[ans.x][ans.y]) { bfs(ans); cnt++; } } /* for(int i=0;i<m;i++) { for(int j=0;j<n;j++) { cout<<vis[i][j]<<' '; } cout<<endl; }*/ cout<<cnt<<endl; } return 0;}
- [kuangbin带你飞]专题一 简单搜索L
- [kuangbin带你飞]专题一 简单搜索 L
- kuangbin带你飞:专题一 简单搜索 L
- [kuangbin带你飞]专题一 简单搜索L - Oil Deposits(HDU 1241)
- [kuangbin带你飞]专题一 简单搜索 L - Oil Deposits HDU1241
- [kuangbin带你飞]专题一 简单搜索 L HDU 1241
- [kuangbin神带你飞]专题一 简单搜索
- kuangbin带你飞 专题一 简单搜索 (题解)
- Fire Game [kuangbin带你飞]专题一 简单搜索
- [kuangbin带你飞]专题一 简单搜索 总结
- Kuangbin带你飞专题一 简单搜索
- [kuangbin带你飞]专题一 简单搜索 D - Fliptile
- [kuangbin带你飞]专题一 简单搜索-J - Fire!
- [kuangbin带你飞]专题一 简单搜索 - H - Pots
- [kuangbin带你飞]专题一 简单搜索 A POJ1321
- [kuangbin带你飞]专题一 简单搜索 B POJ2251
- [kuangbin带你飞]专题一 简单搜索 C POJ3278
- [kuangbin带你飞]专题一 简单搜索 D poj3279
- SQL查询语句题目(二)
- NoSQL文档型数据库之MongoDb的配置与使用
- 2017.10.1 蚯蚓 思考记录
- JVM (PART VI)垃圾收集算法
- typecho安装后登录失败报错 405 Not Allowed nginx/1.10.2
- kuangbin带你飞:专题一 简单搜索 L
- uri,file,path互相转化
- 循环中setTimeout打印结果(使用闭包)
- 第四周Valid Parentheses
- 机器学习常见算法分类汇总
- NOIP 2014 飞扬的小鸟
- 大四生活02:秋招开始
- 【C#】winform软件UI设计模板
- 树规? bzoj4007 战争调度