HDOJ1241Oil Deposits(DFS)
来源:互联网 发布:蹭网器密码破解软件 编辑:程序博客网 时间:2024/06/05 14:17
Oil Deposits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 18169 Accepted Submission(s): 10471
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
0122
/*大致题意是,@代表油田,*代表不是油田的部分,然后根据所给的地图找出有多少块油田,其中如果两块油田是adjacent(相邻的),则属于同一块油田*/
#include<stdio.h>#include<string.h>int m,n,s[8][2]={{1,0},{-1,0},{0,1},{0,-1},{1,1},{1,-1},{-1,1},{-1,-1}};char a[1010][1010];void judge(int x,int y){ if (a[x][y]=='*') return ; if (x>=0&&x<n&&y>=0&&y<m) { a[x][y]='*'; for (int i=0;i<8;i++) { int fx = x + s[i][0]; int fy = y + s[i][1]; judge(fx,fy); } }}int main(){ int i,j; while (scanf ("%d%d",&n,&m)!=EOF) { int sum=0; if ( n == 0|| m == 0) break; for (i = 0;i < n;i++) scanf ("%s",a[i]); for (i=0;i<n;i++) for (j=0;j<m;j++) { if (a[i][j] == '@') { judge(i,j); sum++; } } printf ("%d\n",sum); } return 0;}
0 0
- HDOJ1241Oil Deposits(DFS)
- hdoj1241Oil Deposits bfs|dfs
- hdoj1241Oil Deposits(DFS)
- hdoj1241Oil Deposits
- hdoj1241Oil Deposits
- poj1562&&hdoj1241Oil Deposits
- hdoj1241Oil Deposits(BFS)
- Poj1562Oil Deposits,DFS
- Oil Deposits hdu1241 dfs
- Oil Deposits poj DFS
- POJ1562:Oil Deposits(DFS)
- HDU1241:Oil Deposits(DFS)
- hdu1241(DFS Oil Deposits )
- UVa572 Oil Deposits(DFS)
- HDU1241_Oil Deposits(BFS)+(DFS)
- Oil Deposits DFS水题
- Oil Deposits BFS+DFS
- Oil Deposits uva DFS
- leetcode 69: Sqrt(x)
- Java面向对象--类、对象、封装
- jni 字符串转化为 char* 的方法
- 二维数组作为参数传递的问题
- 深入理解DIP、IoC、DI以及IoC容器
- HDOJ1241Oil Deposits(DFS)
- Applicability Statement 2 (AS2) Module
- 【八校联考2013】百团大战
- iOS UI04_Touch
- HDOJ Square Coins 1398【母函数】
- iOS应用内置付费In-App Purchases入门
- 设计模式之装饰模式
- 【Leetcode】Reorder List
- C++11 标准新特性: 右值引用与转移语义