A7995 | Serial Time!
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
The Cereal Guy's friend Serial Guy likes to watch soap operas. An episode is about to start, and he hasn't washed his plate yet. But he decided to at least put in under the tap to be filled with water. The plate can be represented by a parallelepiped $k×n×m$ , that is, it has $k$ layers (the first layer is the upper one), each of which is a rectangle $n×m$ with empty squares ('.') and obstacles ('#'). The water can only be present in the empty squares. The tap is positioned above the square $(x,y)$ of the first layer, it is guaranteed that this square is empty. Every minute a cubical unit of water falls into the plate. Find out in how many minutes the Serial Guy should unglue himself from the soap opera and turn the water off for it not to overfill the plate. That is, you should find the moment of time when the plate is absolutely full and is going to be overfilled in the next moment.
Note: the water fills all the area within reach (see sample 4). Water flows in each of the 6 directions, through faces of $1×1×1$ cubes.
Note: the water fills all the area within reach (see sample 4). Water flows in each of the 6 directions, through faces of $1×1×1$ cubes.
输入格式
The first line contains three numbers $k$ , $n$ , $m$ ( $1<=k,n,m<=10$ ) which are the sizes of the plate. Then follow $k$ rectangles consisting of $n$ lines each containing $m$ characters '.' or '#', which represents the "layers" of the plate in the order from the top to the bottom. The rectangles are separated by empty lines (see the samples). The last line contains $x$ and $y$ ( $1<=x<=n,1<=y<=m$ ) which are the tap's coordinates. $x$ is the number of the line and $y$ is the number of the column. Lines of each layer are numbered from left to right by the integers from $1$ to $n$ , columns of each layer are numbered from top to bottom by the integers from $1$ to $m$ .
输出格式
The answer should contain a single number, showing in how many minutes the plate will be filled.
输入输出样例
输入 #1
1 1 1 . 1 1
输出 #1
1
输入 #2
2 1 1 . # 1 1
输出 #2
1
输入 #3
2 2 2 .# ## .. .. 1 1
输出 #3
5
输入 #4
3 2 2 #. ## #. .# .. .. 1 2
输出 #4
7
输入 #5
3 3 3 .#. ### ##. .## ### ##. ... ... ... 1 1
输出 #5
13
暂无题解
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted