hdoj 1241 Oil Deposits (dfs)
Oil Deposits
**Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 17683 Accepted Submission(s): 10172
**
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
因为题目中要求求出所有的解,所有很容易想到dfs
枚举grid,当遇到一个油田的时候,就dfs把与他相邻的都标记上.
一遍ac
1
2
3 /*************************************************************************
4 > File Name: code/2015summer/searching/L.cpp
5 > Author: 111qqz
6 > Email: rkz2013@126.com
7 > Created Time: 2015年07月25日 星期六 15时29分28秒
8 ************************************************************************/
9
10 #include<iostream>
11 #include<iomanip>
12 #include<cstdio>
13 #include<algorithm>
14 #include<cmath>
15 #include<cstring>
16 #include<string>
17 #include<map>
18 #include<set>
19 #include<queue>
20 #include<vector>
21 #include<stack>
22 #define y0 abc111qqz
23 #define y1 hust111qqz
24 #define yn hez111qqz
25 #define j1 cute111qqz
26 #define tm crazy111qqz
27 #define lr dying111qqz
28 using namespace std;
29 #define REP(i, n) for (int i=0;i<int(n);++i)
30 typedef long long LL;
31 typedef unsigned long long ULL;
32
33 const int N = 1E2+5;
34 char st[N][N];
35 int m,n;
36 bool v[N][N];
37 int dx[8]={0,0,1,1,1,-1,-1,-1};
38 int dy[8]={1,-1,0,-1,1,0,-1,1};
39 void dfs(int x,int y)
40 {
41 v[x][y]=true;
42 for ( int i = 0 ; i < 8 ; i++ )
43 {
44 int newx=x+dx[i];
45 int newy=y+dy[i];
46 if (newx>=0&&newx<m&&newy>=0&&newy<n&&!v[newx][newy]&&st[newx][newy]=='@')
47 {
48 dfs(newx,newy);
49 }
50 }
51 }
52
53 int main()
54 {
55 while (scanf("%d %d",&m,&n))
56 {
57 if (m==0) break;
58 int ans = 0;
59 memset(v,false,sizeof(v));
60 for (int i = 0 ; i < m ; i++ )
61 scanf("%s",st[i]);
62 for ( int i = 0 ; i < m ; i++ )
63 {
64 for ( int j = 0 ; j < n ; j++)
65 {
66 if (st[i][j]=='@'&&!v[i][j])
67 {
68 ans++;
69 dfs(i,j);
70 }
71 }
72 }
73 queue<int>q;
74 stack<int>s;
75
76 cout<<ans<<endl;
77 }
78 return 0;
79 }
80
81
82```c++
83