HDU 1241 Oil Deposits(DFS)
来源:互联网 发布:隐形口罩 知乎 编辑:程序博客网 时间:2024/06/05 05:27
Oil Deposits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22278 Accepted Submission(s): 12839
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
0122
#include <stdio.h>#include <string.h>#include <iostream>using namespace std;char map[101][101];int n,m;void dfs(int x,int y){ if(x<1||y<1||x>m||y>n) return ; if(map[x][y]=='*') return ; map[x][y]='*'; for(int i=-1; i<2; i++) for(int j=-1; j<2; j++) { int p=x+i; int q=y+j; dfs(p,q); }}int main(){ while (scanf("%d%d",&m,&n)&&n!=0) { int count=0; for(int i=1; i<=m; i++) for(int j=1; j<=n; j++) cin>>map[i][j]; for(int i=1; i<=m; i++) for(int j=1; j<=n; j++) { if(map[i][j]=='@') { dfs(i,j); count++; } } printf("%d\n",count); } return 0;}
0 0
- hdu 1241 Oil Deposits(dfs入门)
- HDU 1241 Oil Deposits(DFS)
- HDU 1241Oil Deposits(dfs搜索)
- HDU 1241 Oil Deposits (DFS)
- [ACM] hdu 1241 Oil Deposits(DFS)
- hdu 1241 Oil Deposits(DFS)
- HDU-#1241 Oil Deposits(BFS & DFS)
- HDU 1241 Oil Deposits(深搜/DFS)
- hdu 1241 Oil Deposits(DFS)
- HDU 1241 Oil Deposits (DFS)
- hdu 1241 Oil Deposits(DFS)
- hdu 1241 Oil Deposits(DFS)
- 【HDU-1241】Oil Deposits油田(dfs)
- HDU 1241 Oil Deposits(DFS)
- HDU 1241Oil Deposits (DFS)
- HDU 1241 Oil Deposits(DFS)
- 【HDU】1241--Oil Deposits(DFS)
- 【hdu 1241】 Oil Deposits (dfs+bfs)
- Java中怎么切换窗口
- 等待中
- html5笔记—— 插入视频音频
- java中用中国网建提供的SMS短信平台发送短信
- Linux学习笔记知识点(一)
- HDU 1241 Oil Deposits(DFS)
- ASCII标准中的数据类型——char int float 的字节大小
- VMware虚拟机从一台电脑转移复制到另一台电脑的方法
- iOS应用逆向工程
- 杭电1061
- C语言输出控制符
- 【BZOJ4514】数字配对,费用流
- 第6周项目3-IP地址类
- 四大浏览器内核简介