PKU 1562 Oil Deposit
2015-04-04 14:23
190 查看
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
Sample Output
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
/* Coder: Shawn_Xue Date: 2015.4.4 Result: AC */ #include <iostream> using namespace std; const int maxn = 110; char map[maxn][maxn]; bool visited[maxn][maxn]; const int dir[8][2] = { {1,0}, {1,1}, {1,-1}, {0,1}, {0,-1}, {-1,-1}, {-1,1}, {-1, 0}}; int m, n; void dfs(int x, int y) { // 越界,边界要控制好 if(x < 1 || y < 1 || x > m || y > n) return; // 空油田 if(map[x][y] == '*') return; // 已访问 if(visited[x][y] == true) return; else visited[x][y] = 1; int nx, ny; for(int i = 0; i < 8; i++) { nx = x+dir[i][0]; ny = y+dir[i][1]; dfs(nx, ny); } } int solves() { int count = 0; for(int i = 1; i <= m; i ++) for(int j = 1; j <= n; j ++) { //油田且没有被访问过 if(map[i][j] == '@' && visited[i][j] == false) { count ++; dfs(i,j); } } return count ; } int main() { while(cin >> m >> n && m) { for( int i = 1; i <= m; i ++) for( int j = 1; j <= n; j ++) { cin >> map[i][j]; visited[i][j] = false; } cout << solves() << endl; } }
相关文章推荐
- DFS PKU 1562
- pku/poj 1562
- pku 1562 Oil Deposits(典型的BFS)
- DFS PKU 1562
- pku1562 Oil Deposits 油田合并(简单深搜)
- pku 1562 Oil Deposits---dfs
- PKU 1562/HDU 1241 Oil Deposits(原油有多少块区域---BFS,DFS)
- Oil Deposits pku 1562
- PKU 1562
- PKU 3974 - Palindrome (最长回文字串 DP)
- PKU1287裸的Kruskal算法低空飘过
- PKU POJ 1006 Biorhythms (中国剩余定理)
- 二分PKU3273
- 假金币问题-PKUacm1029-ACM
- PKU 1019 Number Sequence(模拟,思维)
- PKU 2584 - T-Shirt Gumbo (二分图最大匹配 & 匈牙利算法 | 最大流 & EK)
- Uva572-poj-1562-hdoj--1241--oil Deposits-DFS
- POJ 1562/ ZOJ 1709: Oil Deposits(我的深搜第一题,其实也可用广搜)
- pku1163
- 北大PKU在线测试1004