首页 > 代码库 > (简单) POJ 1562 Oil Deposits，BFS。
(简单) POJ 1562 Oil Deposits，BFS。
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.
就是BFS了，水题吧。
代码如下：
#include<iostream>#include<cstring>using namespace std;int vis[110][110];int ans;int M,N;int fir,las,que[10005];bool judge(int x,int y){ if(x<=0||y<=0||x>M||y>N) return 0; if(vis[x][y]==0) return 0; return 1;}void bfs(int x,int y){ int temp,t1,t2; que[las++]=x*1000+y; vis[x][y]=0; while(las-fir) { temp=que[fir++]; t1=temp/1000; t2=temp%1000; --t1; if(judge(t1,t2)) { vis[t1][t2]=0; que[las++]=t1*1000+t2; } t1+=2; if(judge(t1,t2)) { vis[t1][t2]=0; que[las++]=t1*1000+t2; } --t1; --t2; if(judge(t1,t2)) { vis[t1][t2]=0; que[las++]=t1*1000+t2; } t2+=2; if(judge(t1,t2)) { vis[t1][t2]=0; que[las++]=t1*1000+t2; } t2-=2; --t1; if(judge(t1,t2)) { vis[t1][t2]=0; que[las++]=t1*1000+t2; } t1+=2; if(judge(t1,t2)) { vis[t1][t2]=0; que[las++]=t1*1000+t2; } t2+=2; if(judge(t1,t2)) { vis[t1][t2]=0; que[las++]=t1*1000+t2; } t1-=2; if(judge(t1,t2)) { vis[t1][t2]=0; que[las++]=t1*1000+t2; } }}void slove(){ ans=0; fir=las=0; for(int i=1;i<=M;++i) for(int j=1;j<=N;++j) if(vis[i][j]) { ++ans; bfs(i,j); }}int main(){ ios::sync_with_stdio(false); char c; for(cin>>M>>N;M;cin>>M>>N) { for(int i=1;i<=M;++i) for(int j=1;j<=N;++j) { cin>>c; vis[i][j]=c==‘@‘?1:0; } slove(); cout<<ans<<endl; } return 0;}
(简单) POJ 1562 Oil Deposits，BFS。
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。