hdu -1241 Oil Deposits
2013-08-14 10:40
232 查看
Oil Deposits
[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]
[align=left]0[/align]
[align=left]1[/align]
[align=left]2[/align]
[align=left]2[/align]
[align=left] [/align]
[align=left] [/align]
[align=left]bfs 借鉴的别人的代码 看明白了才发现思想很简单,以前一直钻牛角尖~ [/align]
[align=left] [/align]
#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-1241-Oil Deposits(dfs水)
- HDU 1241 Oil Deposits (DFS/BFS)
- hdu 1241 Oil Deposits(八方向简单深搜,对新手挺经典)
- HDU 1241 BFS-Oil Deposits
- HDU-1241 Oil Deposits 【dfs】
- hdu 1241 Oil Deposits
- HDU1241 Oil Deposits DFS
- hdu 1241 Oil Deposits
- HDU 1241 Oil Deposits(DFS模板题)
- 杭电(hdu)1241 Oil Deposits
- hdu 1241 Oil Deposits (dfs)
- hdu 1241 Oil Deposits (dfs)
- HDU 1241 Oil Deposits
- 文章标题 HDU 1241 : Oil Deposits (BFS)
- HDU 1241:Oil Deposits(BFS)
- hdu 1241 Oil Deposits
- hdu 1241 Oil Deposits
- HDOJ/HDU 1241 Oil Deposits(经典DFS)
- hdu 1241 Oil Deposits <java>
- hdu 1241 Oil Deposits