hdu 1241 Oil Deposits(DFS)
来源:互联网 发布:淘宝无法付款 系统异常 编辑:程序博客网 时间:2024/06/05 09:59
Oil Deposits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14951 Accepted Submission(s): 8592
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题意:给一个图,*代表没有油,@代表有油(称为pocket),邻近的(上下左右及对角)pocket一起叫做oil deposit,求有几个oil deposit1.memset(map,'*',sizeof(map));能将map[][]都赋值为'*'代码:#include<cstdio>#include<cstring>using namespace std;char map[105][105];int m,n;int dir[8][2]= {1,0,-1,0,0,1,0,-1,1,1,-1,-1,1,-1,-1,1};void DFS(int x,int y){ if(map[x][y]=='*') return; map[x][y]='*'; for(int i=0; i<8; i++) { int tx=x+dir[i][0]; int ty=y+dir[i][1]; //if(tx>=1&&tx<=m&&ty>=1&&ty<=n) DFS(tx,ty); }}int main(){ int cnt; while(scanf("%d%d",&m,&n),m||n) { cnt=0; memset(map,'*',sizeof(map)); //for(int i=1; i<=m; i++) //scanf("%s",map[i]+1); getchar(); for(int i=1; i<=m; i++) { for(int j=1; j<=n; j++) scanf("%c",&map[i][j]); getchar(); } for(int i=1; i<=m; i++) for(int j=1; j<=n; j++) { if(map[i][j]=='@') { DFS(i,j); cnt++; } } printf("%d\n",cnt); } return 0;}代码2:#include<cstdio>#include<cstring>using namespace std;char map[105][105];int m,n;int dir[8][2]= {1,0,-1,0,0,1,0,-1,1,1,-1,-1,1,-1,-1,1};void DFS(int x,int y){ if(map[x][y]=='*') return; map[x][y]='*'; for(int i=0; i<8; i++) { int tx=x+dir[i][0]; int ty=y+dir[i][1]; if(tx>=1&&tx<=m&&ty>=1&&ty<=n) DFS(tx,ty); }}int main(){ int cnt; while(scanf("%d%d",&m,&n),m||n) { cnt=0; memset(map,'*',sizeof(map)); for(int i=1; i<=m; i++) scanf("%s",map[i]+1); //getchar(); //for(int i=1; i<=m; i++) //{ // for(int j=1; j<=n; j++) // scanf("%c",&map[i][j]); // getchar(); //} for(int i=1; i<=m; i++) for(int j=1; j<=n; j++) { if(map[i][j]=='@') { DFS(i,j); cnt++; } } printf("%d\n",cnt); } 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)
- Azure 负载平衡器新分发模式
- COM学习笔记8_IDispatch (调度接口) 自动化
- iOS开发数据库篇—SQL
- HDU4342 History repeat itself数学规律题
- 多线程下变量-原子操作 __sync_fetch_and_add等等
- hdu 1241 Oil Deposits(DFS)
- 浏览器兼容问题总结
- HDU(1273)——漫步森林(数学的找规律题)
- 图片循环播放,可以控制时间
- pipe()函数的使用
- Ubuntu 14.04 安装jdk AndroidStudio
- iOS开发数据库篇—SQL代码应用示例
- java 动态获取web应用的部署路径
- Java语言基础——第九回 多态、接口