hdu -1241 Oil Deposits
来源:互联网 发布:java 发邮件代码 编辑:程序博客网 时间:2024/05/29 20:03
Oil Deposits
Problem 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 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 借鉴的别人的代码 看明白了才发现思想很简单,以前一直钻牛角尖~
#include <iostream>using namespace std;int n,m;char s[100][100];int dir[8][2]={1,1, 1,-1, -1,1, -1,-1, 0,1, 0,-1, 1,0, -1,0};int i,j;int fn(int &a,int &b){ int x,y; for(int i=0;i<8;i++) { x=a+dir[i][0]; y=b+dir[i][1]; if(x<0||y<0||x>=n||y>=m||s[x][y]=='*') { continue; } s[x][y]='*'; fn(x,y); }}int main(){while(cin>>n>>m){if(n==0&&m==0)return 0; int count=0;for(i=0;i<n;i++){for(j=0;j<m;j++){cin>>s[i][j];}}for(int i=0;i<n;i++){for(int j=0;j<m;j++){if(s[i][j]=='@'){s[i][j]='*';fn(i,j);count++;}}}cout<<count<<endl;}return 0;}
- HDU 1241Oil Deposits
- HDU---1241Oil Deposits
- Hdu 1241 Oil Deposits
- Hdu 1241 - Oil Deposits
- HDU-1241:Oil Deposits
- hdu 1241 Oil Deposits
- hdu 1241 Oil Deposits
- hdu 1241 Oil Deposits
- hdu - 1241 - Oil Deposits
- HDU-1241Oil Deposits
- hdu 1241 Oil Deposits
- hdu 1241 Oil Deposits
- HDU 1241 Oil Deposits
- hdu 1241 Oil Deposits
- hdu 1241 Oil Deposits
- HDU 1241 Oil Deposits
- hdu-1241-Oil Deposits
- hdu 1241 Oil Deposits
- 开通BLOG
- Linux buffer和cache区别
- hdu 4669 Mutiples on a circle 多校第七场
- HTTPS是如何保证连接安全:每位Web开发者都应知道的
- 克鲁斯卡尔(Kruskal)算法
- hdu -1241 Oil Deposits
- android 将一个bitmap保存成图片文件
- gcc静态库链接的问题
- hdu2802之矩阵乘法
- HDOJ 1042
- Linux中如何创建静态库和动态库
- 优秀Jquery插件
- 解决Ajax请求出现Uncaught SyntaxError: Unexpected token : 错误
- 【美化§风景之雾漫城市之颠win7电脑主题】