搜索专题:HDU1241 Oil Deposits
Oil Deposits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 32337 Accepted Submission(s): 18765
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.
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.
1 1
*
3 5
*@*@*
**@**
*@*@*
1 8
@@****@*
5 5
****@
*@@*@
*@**@
@@@*@
@@**@
0 0
0
1
2
2
|
最新文章
- svn比对
- 访问外网 ML2 的配置 - 每天5分钟玩转 OpenStack(103)
- sql操作
- Vue 为什么在 HTML 中监听事件?
- SQLServer 维护脚本分享(11)部分DBCC及系统存储过程
- 纯js分页代码(简洁实用)
- POJ 1182 食物链(种类并查集)
- Poj OpenJudge 百练 2389 Bull Math
- bzoj1072
- poj 1007 纯水题 排序
- Tips_of_JS 之 利用JS实现水仙花数的寻找与实现斐波那契数列
- 11 Linear Models for Classification
- 浅谈this关键字
- promisify,promisifyAll,promise.all实现原理
- tail -f 报错 file truncated
- linux符号与正则表达式
- windows程序设计 MessageBox消息框
- SDI视频采集过程
- Outlook数据提取工具readpst
- MetaPost使用