mysql创建只读账号
2015-11-03 14:56
489 查看
Oil Deposits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7709 Accepted Submission(s): 4514
[align=left]Problem Description[/align] 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.
[align=left]Input[/align] 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.
[align=left]Output[/align] 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.
[align=left]Sample Input[/align]
1 1 * 3 5 *@*@* **@** *@*@* 1 8 @@****@* 5 5 ****@ *@@*@ *@**@ @@@*@ @@**@ 0 0
[align=left]Sample Output[/align]
0 1 2 2
[align=left]Source[/align] Mid-Central USA 1997
[align=left]Recommend[/align] Eddy
解题思路:广度优先搜索,图的连通分量。
遍历图——>找到油田——>把油田群找出来——>标记、计数——>继续遍历——>遍历完成
只要相邻既是一起,也就是说,遍历方向有8个,所有相邻的都算。
#include<cstdio> #include<cstring> #include<queue> using namespace std; int n,m; char map[100][100]; int sum; int dir[8][2]={1,0,1,1,1,-1,0,1,0,-1,-1,0,-1,1,-1,-1}; //8个方向 struct node { int x; int y; }; int inmap(int x,int y) { if(x>=0&&x<n&&y>=0&&y<m) return true; return false; } void bfs(int x,int y) { int i; node u,v; queue<node> q; u.x=x; u.y=y; q.push(u); while(!q.empty()) { u=q.front(); q.pop(); for(i=0;i<8;i++) { v.x=u.x+dir[i][0]; v.y=u.y+dir[i][1]; if(inmap(v.x,v.y)&&map[v.x][v.y]=='@') //是油田哦 { map[v.x][v.y]='*'; //油田群遍历,标记 q.push(v); } } } } int main() { int i,j; while(scanf("%d%d",&n,&m)&&m) { sum=0; for(i=0;i<n;i++) scanf("%s",map[i]); for(i=0;i<n;i++) { for(j=0;j<m;j++) { if(map[i][j]=='@') //找到油田 { sum++; bfs(i,j); } } } printf("%d\n",sum); } return 0; }
本文出自 “try it” 博客,请务必保留此出处http://huahua520amy.blog.51cto.com/6729449/1373693
相关文章推荐
- [MySQL FAQ]系列 — 从MyISAM转到InnoDB需要注意什
- [MySQL FAQ]系列 — 如何查看当前最新事务ID
- MySQL远程访问:错误码1130解决方案
- MySQL中BLOB字段类型介绍
- 浅谈海量DB的备份设计
- MySQL错误大全
- Transparent Hugepage造成带ToKudb引擎的Mysql无法启动
- mysql创建和删除用户
- Mysql pid 文件
- mysqlworkbench 'delayed-insert=FALSE'
- MYsql 锁详解 锁 与索引的关系
- Can't create a new thread (errno 11) 解决办法 mysql无法连接
- SSH分页+Mysql
- cannot create poolableconnectionfactory mysqlDataSource
- brew mysql 添加修改mysql配置
- mysql show processlist整理
- 查看mysql 主从的状态
- window7 MySql Cluster数据库集群配置
- nodejs+mysql入门实例
- brew安装的mysql启动报错