POJ-1562(DFS)
来源:互联网 发布:编程电极怎么编 编辑:程序博客网 时间:2024/05/20 21:48
Oil Deposits
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 81 Accepted Submission(s) : 51
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
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
恩又是道连通块的题目,
唯一区别就是横纵变成横纵斜,
只要改一下dfs函数中的递归方式即可解决,
#include <iostream>#include <string.h>#include <cmath>#include <stdio.h>using namespace std;int n,m;int b[3]={-1,0,1};int cnt;char s[110][110];int mx,my;void dfs(int x,int y){ s[x][y]='.'; for(int i=0;i<3;i++) { for(int j=0;j<3;j++) { mx=x+b[i]; my=y+b[j]; if(s[mx][my]=='@'&&mx>=0&&my>=0&&mx<n&&my<m) { s[mx][my]='.'; dfs(mx,my); } } }}int main(){ while(~scanf("%d%d",&n,&m)&&n&&m) { cnt=0; for(int i=0;i<n;i++) { for(int j=0;j<m;j++) { cin>>s[i][j]; } } for(int i=0;i<n;i++) { for(int j=0;j<m;j++) { if(s[i][j]=='@') { cnt++; dfs(i,j); } } } cout<<cnt<<endl; }}
0 0
- POJ-1562(DFS)
- POJ 1562 (简单dfs)
- Oil Deposits (POJ No.1562) DFS
- [poj 1562] Oil Deposits(dfs)
- POJ-1562-Oil Deposits(DFS)
- poj 1562 DFS+枚举
- POJ 3194 (DFS)
- POJ--2386(dfs)
- POJ-2492(DFS)
- POJ-1655(DFS)
- POJ 2386(DFS)
- POJ Hopscotch (DFS)
- POJ-2197(DFS)
- POJ 2488(DFS)
- POJ 1321 (DFS)
- POJ 3009(Dfs)
- POJ 2488(DFS)
- POJ 2676(DFS)
- 四个月的蜕变之单例模式创建线程池和使用
- 《Head First设计模式》-工厂模式C++实现
- python 2-5 如何快速找到多个字典中的(key) viewkeys(集合)/reduce(lambda a,b:a&b,map(d.keys(),[d1,d2])
- zoj2314
- mysql5.7 修改默认密码
- POJ-1562(DFS)
- linux 用户和组管理
- 派生类和继承——(二)
- Indivisibility——Codeforce
- windows和linux下使用python2.7 urllib.urlopen+beautifulsoup打开12306网站订票页面表现不同,前者报错ssl认证失败,后者成功
- bfs+预处理+路径回溯+字典序最小+hash
- java线程同步之Lock锁
- socket编程中write、read和send、recv之间的区别
- Android 手机微服务架构的简单实现