POJ 1562 DFS水题练习
2010-11-19 08:45
253 查看
Oil Deposits
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 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
are adjacent horizontally, vertically, or diagonally. An oil deposit will not contain more than 100 pockets.
Sample Input
Sample Output
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 6282 | Accepted: 3557 |
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 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
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
#include<stdio.h> #include<stdlib.h> int m,n; char grid[102][102]; void DFS(int a,int b) { if(grid[a][b]=='*'||a<0||b<0||a>m-1||b>n-1) return; grid[a][b]='*'; //printf("访问grid[%d][%d]/n",a,b); DFS(a,b+1); DFS(a,b-1); DFS(a-1,b-1); DFS(a-1,b+1); DFS(a-1,b); DFS(a+1,b-1); DFS(a+1,b); DFS(a+1,b+1); } int main() { int i,j; int cnt; while(scanf("%d %d",&m,&n)!=EOF&&m!=0) { cnt=0; memset(grid,0,sizeof(grid)); for(i=0;i<m;i++) scanf("%s",grid[i]); for(i=0;i<m;i++) for(j=0;j<n;j++) { if(grid[i][j]=='@') { cnt++; DFS(i,j); } } printf("%d/n",cnt); } return 0; }[/code]
相关文章推荐
- POJ 1562 DFS水题练习
- POJ1562 dfs水题
- POJ 1979 Red and Black DFS水题
- poj1562--Oil Deposits(DFS)
- HDU1241 POJ1562 UVa572 UVALive5317 Oil Deposits【DFS】
- zoj 1874 || poj 1562 Primary Arithmetic(水题。)
- poj 3009 DFS水题
- POJ 2531 Network Saboteur (dfs+水题)
- poj 1753 Flip Game(搜索:DFS+水题)
- poj 1562 || zoj 1709 Oil Deposits(DFS)
- poj1562--DFS
- poj 2386 Lake Counting(DFS 杂这么多这种类型的水题啊。。。。)
- POJ 1562 && HDU 1241 Oil Deposits(dfs)
- poj 1979 Red and Black(dfs水题)
- POJ 1321 棋盘问题(DFS板子题,简单搜索练习)
- poj 1562 dfs
- UVa 572/POJ 1562/HDU 1241 Oil Deposits(DFS,两种写法)
- POJ 1003 Hangover 水题一道 练习C++编程
- POJ 1562 Oil Deposits(dfs)
- ACM-POJ 1562 DFS 深度优先搜索