hdoj 1241 Oil Deposits
来源:互联网 发布:javascript 编译 编辑:程序博客网 时间:2024/06/07 05:18
Oil Deposits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 14935 Accepted Submission(s): 8582
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
dfs:
#include<stdio.h>#include<string.h>char map[110][110];int move[8][2]={1,0,-1,0,0,1,0,-1,1,1,-1,-1,1,-1,-1,1};int h,w;void dfs(int x,int y){ int next_x,next_y,i; map[x][y]='*'; for(i=0;i<8;i++) { next_x=x+move[i][0]; next_y=y+move[i][1]; if(next_x>=0&&next_x<h&&next_y>=0&&next_y<w) { if(map[next_x][next_y]=='@') { dfs(next_x,next_y); } } }}int main(){ int i,j,sum; while(scanf("%d%d",&h,&w)&&(h!=0||w!=0)) { for(i=0;i<h;i++) scanf("%s",map[i]); sum=0; for(i=0;i<h;i++) { for(j=0;j<w;j++) { if(map[i][j]=='@') { dfs(i,j); sum++; } } } printf("%d\n",sum); } return 0;}
0 0
- hdoj 1241 Oil Deposits
- hdoj 1241 Oil Deposits
- HDOJ 1241 Oil deposits
- HDOJ 1241 Oil Deposits
- HDOJ 1241 Oil Deposits
- HDOJ 1241 Oil Deposits
- hdoj 1241 Oil Deposits
- hdoj 1241 Oil Deposits
- hdoj 1241 Oil Deposits
- hdoj 1241 Oil Deposits
- hdoj-1241-Oil Deposits
- HDOJ-1241 Oil Deposits
- HDOJ - 1241 Oil Deposits
- hdoj-1241【Oil Deposits】
- hdoj 1241 Oil Deposits
- hdoj-1241 Oil Deposits
- HDOJ--1241--Oil Deposits【DFS】
- ACM HDOJ 1241 (Oil Deposits)
- Codeforces Round #289 (Div. 2, ACM ICPC Rules) C. Sums of Digits
- java长数据相乘
- 欢迎使用Markdown编辑器写博客
- LNMP
- .tpk格式文件简介
- hdoj 1241 Oil Deposits
- Java 抽象方法
- 使用Fiddler调试手机页面请求
- Dev BarManager用法
- 查看电脑配置信息
- 合天安全实验室CTF之解密100
- Android 屏幕适配1
- iqiangwang
- MTK编译环境中makefile文件中常用变量值