hdu 1241 Oil Deposits <java>
来源:互联网 发布:秦国 军国主义 知乎 编辑:程序博客网 时间:2024/06/08 10:59
Oil Deposits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5865 Accepted Submission(s): 3423
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
Source
Mid-Central USA 1997
Recommend
Eddy
import java.util.Scanner; public class Main { static int px[]={-1,-1,-1,0,1,1,1,0}; static int py[]={-1,0,1,1,1,0,-1,-1}; static public void DFS(int i,int j,char a[][],boolean b[][],int m,int n){ int k,x,y; b[i][j]=true; for(k=0;k<8;k++){ x=i+px[k]; y=j+py[k]; if(x>=0&&x<m&&y<n&&y>=0){ if(b[x][y]==false&&a[x][y]=='@'){ DFS(x,y,a,b,m,n); } } } } public static void main(String[] args) { int m,n,i,j,k; Scanner oo=new Scanner(System.in); while(oo.hasNext()){ m=oo.nextInt(); n=oo.nextInt(); if(m==0&&n==0){break;} String s; char a[][]=new char[m][n]; for(i=0;i<m;i++){ s=oo.next(); for(j=0;j<n;j++){ a[i][j]=s.charAt(j); } } k=0; boolean b[][]=new boolean[m][n]; for(i=0;i<m;i++){ for(j=0;j<n;j++){ if(a[i][j]=='@'&&b[i][j]==false){ k++; DFS(i,j,a,b,m,n); } } } System.out.println(k); } } }
- hdu 1241 Oil Deposits <java>
- HDU 1241Oil Deposits
- HDU---1241Oil Deposits
- Hdu 1241 Oil Deposits
- Hdu 1241 - Oil Deposits
- HDU-1241:Oil Deposits
- hdu 1241 Oil Deposits
- hdu 1241 Oil Deposits
- hdu 1241 Oil Deposits
- hdu - 1241 - Oil Deposits
- HDU-1241Oil Deposits
- hdu 1241 Oil Deposits
- hdu 1241 Oil Deposits
- HDU 1241 Oil Deposits
- hdu 1241 Oil Deposits
- hdu 1241 Oil Deposits
- HDU 1241 Oil Deposits
- hdu-1241-Oil Deposits
- session 性能优化
- python中文分词
- C#名词解释
- JPG和RAR结合并转换技术
- CSS了解单位em和px的区别
- hdu 1241 Oil Deposits <java>
- 给Ogre添加物理引擎Physx
- selenium常用知识点(一)
- ubuntu 下php的安装配置 转自http://dsec.pku.edu.cn/~lyj/Programming/configure_php.html
- 选择排序法
- 用于SD卡启动android的脚本
- 【网盘】SparkleShare:DropBox 的开源替代品
- axis2 实例
- C和C++中static、不同源文件中成员和函数的互相访问的比较