hdu 1241 Oil Deposits
2014-09-24 22:59
281 查看
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 12466 Accepted Submission(s): 7249[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
1 1 * 3 5 *@*@* **@** *@*@* 1 8 @@****@* 5 5 ****@ *@@*@ *@**@ @@@*@ @@**@ 0 0
[align=left]Sample Output[/align]
0 1 2 2 dfs的基础题#include <iostream> #include <cstring> #include <cstdio> #include <cmath> using namespace std; const int d[8][2]={{1,0},{-1,0},{0,1},{0,-1},{1,-1},{1,1},{-1,1},{-1,-1}}; char map[105][105]; int n,m; void dfs(int x,int y) { if(map[x][y]!='@') return ; map[x][y]='*'; for(int i=0;i<8;i++) { int xx=x+d[i][0],yy=y+d[i][1]; if(xx>=0 && xx<n && yy>=0 && yy<m) dfs(xx,yy); } } int main() { while(scanf("%d%d",&n,&m)!=EOF) { getchar(); if(n==0 && m==0) break; for(int i=0;i<n;i++) gets(map[i]); int num=0; for(int i=0;i<n;i++) for(int j=0;j<m;j++) if(map[i][j]=='@') { dfs(i,j); num++; } cout<<num<<endl; } return 0; }
相关文章推荐
- hdu 1241 Oil Deposits (最经典的dfs)
- HDU 1241 Oil Deposits
- hdu 1241 Oil Deposits (最经典的dfs)
- HDU 1241 Oil Deposits
- hdu 1241 Oil Deposits
- POJ 1562 Oil Deposits (HDU 1241 ZOJ 1562) DFS
- hdu 1241 Oil Deposits 深搜 Ac
- hdu 1241 Oil Deposits - bfs
- hdu-1241 Oil Deposits
- HDU-1241- Oil Deposits (搜索)
- Oil Deposits (HDU 1241)
- hdu 1241 Oil Deposits
- (HDU - 1241)Oil Deposits
- 杭电 hdu 1241 Oil Deposits
- POJ 1562 Oil Deposits (HDU 1241 ZOJ 1562) DFS
- HDU 1241 Oil Deposits 油田 搜索
- hdu 1241 Oil Deposits
- HDU 1241 Oil Deposits ([kuangbin带你飞]专题一 简单搜索)
- HDU 1241 Oil Deposits
- hdu 1241 Oil Deposits