DFS PKU 1562
2014-10-01 10:21
246 查看
简单的DFS
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
Oil Deposits
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 12801 | Accepted: 6998 |
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> #include <malloc.h> #include <limits.h> #include <ctype.h> #include <string.h> #include <string> #include <math.h> #include <algorithm> #include <iostream> #include <queue> #include <stack> #include <deque> #include <vector> #include <set> //#include <map> using namespace std; #define MAXN 100 + 10 char map[MAXN][MAXN]; int vis[MAXN][MAXN]; int m,n; //int count; int xx[8] = {-1,-1,0,1,1,1,0,-1}; int yy[8] = {0,1,1,1,0,-1,-1,-1}; void DFS(int x,int y){ int i; for(i=0;i<8;i++){ int dx = x+xx[i]; int dy = y+yy[i]; if(dx>=0 && dx<m && dy>=0 && dy<n){ if(map[dx][dy]=='@' && vis[dx][dy]==0){ vis[dx][dy] = 1; DFS(dx,dy); //vis[dx][dy] = 0; } } } return ; } int main(){ int i,j; int ans; while(~scanf("%d%d",&m,&n)){ if(m==0 && n==0){ break; } for(i=0;i<m;i++){ scanf("%s",map[i]); } ans = 0; memset(vis,0,sizeof(vis)); for(i=0;i<m;i++){ for(j=0;j<n;j++){ if(map[i][j]=='@' && vis[i][j]==0){ vis[i][j] = 1; ans++; DFS(i,j); //vis[i][j] = 0; } } } printf("%d\n",ans); } }
相关文章推荐
- pku 1562 Oil Deposits---dfs
- DFS PKU 1562
- PKU 1562/HDU 1241 Oil Deposits(原油有多少块区域---BFS,DFS)
- POJ1562 dfs水题
- [poj 1562] Oil Deposits(dfs)
- POJ 1562 && ZOJ 1709 Oil Deposits(简单DFS)
- poj 1562 || zoj 1709 Oil Deposits(DFS)
- pku 2531 Network Saboteur DFS
- poj 1562 dfs
- PKU1416 DFS回溯。。。。
- POJ 1562 Oil Deposits(dfs)
- DFS:POJ1562-Oil Deposits(求连通块个数)
- pku 1691 Painting A Board DFS 抽象建图 + 拓扑排序
- pku 1146 dfs
- pku1562 Oil Deposits 油田合并(简单深搜)
- pku 3083 Children of the Candy Corn DFS+BFS
- pku 1691 painting a board dfs+回溯 解题报告
- pku 2488 A Knight's Journey (搜索 DFS)
- poj 1562 Oil Deposits (dfs)
- PKU-1011 Sticks (DFS + 剪枝)