ZOJ Problem Set - 1709 Oil Deposits
2013-07-11 23:51
281 查看
ZOJ Problem Set - 1709
Oil Deposits
Time Limit: 2 Seconds
Memory Limit: 65536 KB
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
简单的深搜题,一遍就过了
Oil Deposits
Time Limit: 2 Seconds
Memory Limit: 65536 KB
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
简单的深搜题,一遍就过了
#include<iostream> #include<stdio.h> #include<string.h> using namespace std; int count; int m,n; char map[110][110]; int flag[110][110]; void dfs(int r,int c,int count) { if(r<0||c<0||r>=m||c>=n) return; else if(flag[r][c]!=0)return; else if(map[r][c]=='*')return; else { flag[r][c]=count; dfs(r,c-1,count); dfs(r-1,c-1,count); dfs(r-1,c,count); dfs(r-1,c+1,count); dfs(r,c+1,count); dfs(r+1,c+1,count); dfs(r+1,c,count); dfs(r+1,c-1,count); } } int main() { while((cin>>m>>n)&&m!=0) { memset(map,0,sizeof(map)); memset(flag,0,sizeof(flag)); for(int i=0;i<m;i++) { for(int j=0;j<n;j++) { cin>>map[i][j]; } } count=0; for(int i=0;i<m;i++) { for(int j=0;j<n;j++) { if(flag[i][j]!=0)continue; if(map[i][j]=='*')continue; dfs(i,j,++count); } } /*cout<<"=====flag====="<<endl; for(int i=0;i<m;i++) { for(int j=0;j<n;j++) { cout<<flag[i][j]<<' '; } cout<<endl; } cout<<"=====flag====="<<endl;*/ cout<<count<<endl; } }
相关文章推荐
- ZOJ Problem Set - 1002
- ZOJ Problem Set - 1091 Knight Moves
- ZOJ Problem Set - 2744 Palindromes(字符串二分处理的好题)
- ZOJ Problem Set - 2876 Phone List
- ZOJ Problem Set - 2772 Quick Change
- ZOJ Problem Set - 1712||Skew Binary
- ZOJ Problem Set - 2186 Keep on Truckin'
- ZOJ Problem Set - 1392 The Hardest Problem Ever
- ZOJ Problem Set - 1010
- ZOJ Problem Set - 1014
- ZOJ Problem Set - 1004 Anagrams by Stack
- ZOJ Problem Set - 1586
- ZOJ Problem Set - 3782 Ternary Calculation
- ZOJ Problem Set 1002: Fire Net
- ZOJ Problem Set - 3938 (模拟)
- ZOJ Problem Set - 1949 Error Correction
- ZOJ Problem Set - 3938 Defuse the Bomb
- ZOJ Problem Set - 1092Arbitrage
- ZOJ Problem Set - 3664 Split the Rectangle
- ZOJ Problem Set - 1455