Oil Deposits( hdu1241
2015-07-16 16:38
295 查看
http://acm.hust.edu.cn/vjudge/contest/view.action?cid=82828#problem/L
Oil Deposits
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
Submit Status
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
0 1 2 2
Oil Deposits
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
Submit Status
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
0 1 2 2
#include<iostream> #include<algorithm> #include<cstring> #include<cstdio> #include<queue> #include<cmath> using namespace std; #define N 110 char maps ; int m, n; void DFS(int o, int p); int dir[8][2] = { {-1,-1},{-1,0},{-1,1},{0,-1},{0,1},{1,-1},{1,0},{1,1}}; int main() { int i, j, cou; while(cin >> m >> n, m+n) { cou = 0; for(i = 0; i < m; i++) cin >> maps[i]; for(i = 0; i < m; i++) for(j = 0; j < n; j++) { if(maps[i][j] == '@') { cou++; DFS(i, j); } } cout << cou << endl; } return 0; } void DFS(int o, int p) { int i, q, w; maps[o][p] = '*'; for(i = 0; i < 8; i++) { q = o + dir[i][0]; w = p + dir[i][1]; if(q >= 0 && q < m && w >= 0 && w < n && maps[q][w] == '@') DFS(q, w); } }
相关文章推荐
- [转]redis服务器与客户端保活参数(tcp-keepalive)设置
- spark on yarn 安装笔记
- Android中截取照片
- Ubuntu 安装mysql
- ROS探索总结(三)——ROS新手教程
- C++关键字mutable
- 【Android测试】【第三节】ADB——源码浅谈
- C# 中解决页面刷新后字体等变大问题
- spark on yarn 安装笔记
- Android的网络与通信(转)
- [LintCode]unique paths
- MYSQL数据导入EXCEL
- Bitmap
- 公开的Webservice
- Win10正式版发布前 Win10系统新蓝牙协议通过SIG认证
- DOM节点的作用
- 企鹅智酷“2015年互联网终极报告——解读九大行业红利”
- SO_LINGER和优雅关闭连接
- libvlc的录像功能
- 欢迎使用CSDN-markdown编辑器