Oil Deposits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14538 Accepted Submission(s): 8380
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寻找石油,石油相邻的8个方向若是有石油,则属于一个石油地方。英语不好,先前没有看懂什么意思,但是之前做过的一道题目和这道题目类似,所以改了几个地方,就AC了。代码:#include<stdio.h> int n, m; int num; int a[105][105]; char map[8][2] = {{0,1},{0,-1},{1,0},{-1,0},{1,1},{1,-1},{-1,1},{-1,-1}}; void bfs(int x,int y) { int i; for(i = 0; i <8; i ++) { int xx = x + map[i][0]; int yy = y + map[i][1]; if(xx >= 0 && xx < n && yy >= 0 && yy < m && a[xx][yy] == '@') { a[xx][yy] = '*'; bfs(xx,yy); } } } int main() { int i, j; while(scanf("%d%d",&n,&m) != EOF) { if(n == 0 && m == 0) break; num = 0; for(i = 0;i < n;i ++) { for(j = 0;j < m;j ++) { scanf(" %c",&a[i][j]); } } for(i = 0;i < n;i ++) { for(j = 0;j < m;j ++) { if(a[i][j] == '@') { a[i][j] = '*'; num ++; bfs(i,j); } } } printf("%d\n",num); } return 0; }