A10340 | Three-dimensional Turtle Super Computer
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
A super computer has been built in the Turtle Academy of Sciences. The computer consists of $n·m·k$ CPUs. The architecture was the paralellepiped of size $n×m×k$ , split into $1×1×1$ cells, each cell contains exactly one CPU. Thus, each CPU can be simultaneously identified as a group of three numbers from the layer number from $1$ to $n$ , the line number from $1$ to $m$ and the column number from $1$ to $k$ .
In the process of the Super Computer's work the CPUs can send each other messages by the famous turtle scheme: CPU $(x,y,z)$ can send messages to CPUs $(x+1,y,z)$ , $(x,y+1,z)$ and $(x,y,z+1)$ (of course, if they exist), there is no feedback, that is, CPUs $(x+1,y,z)$ , $(x,y+1,z)$ and $(x,y,z+1)$ cannot send messages to CPU $(x,y,z)$ .
Over time some CPUs broke down and stopped working. Such CPUs cannot send messages, receive messages or serve as intermediates in transmitting messages. We will say that CPU $(a,b,c)$ controls CPU $(d,e,f)$ , if there is a chain of CPUs $(x_{i},y_{i},z_{i})$ , such that $(x_{1}=a,y_{1}=b,z_{1}=c)$ , $(x_{p}=d,y_{p}=e,z_{p}=f)$ (here and below $p$ is the length of the chain) and the CPU in the chain with number $i$ ( $i<p$ ) can send messages to CPU $i+1$ .
Turtles are quite concerned about the denial-proofness of the system of communication between the remaining CPUs. For that they want to know the number of critical CPUs. A CPU $(x,y,z)$ is critical, if turning it off will disrupt some control, that is, if there are two distinctive from $(x,y,z)$ CPUs: $(a,b,c)$ and $(d,e,f)$ , such that $(a,b,c)$ controls $(d,e,f)$ before $(x,y,z)$ is turned off and stopped controlling it after the turning off.
In the process of the Super Computer's work the CPUs can send each other messages by the famous turtle scheme: CPU $(x,y,z)$ can send messages to CPUs $(x+1,y,z)$ , $(x,y+1,z)$ and $(x,y,z+1)$ (of course, if they exist), there is no feedback, that is, CPUs $(x+1,y,z)$ , $(x,y+1,z)$ and $(x,y,z+1)$ cannot send messages to CPU $(x,y,z)$ .
Over time some CPUs broke down and stopped working. Such CPUs cannot send messages, receive messages or serve as intermediates in transmitting messages. We will say that CPU $(a,b,c)$ controls CPU $(d,e,f)$ , if there is a chain of CPUs $(x_{i},y_{i},z_{i})$ , such that $(x_{1}=a,y_{1}=b,z_{1}=c)$ , $(x_{p}=d,y_{p}=e,z_{p}=f)$ (here and below $p$ is the length of the chain) and the CPU in the chain with number $i$ ( $i<p$ ) can send messages to CPU $i+1$ .
Turtles are quite concerned about the denial-proofness of the system of communication between the remaining CPUs. For that they want to know the number of critical CPUs. A CPU $(x,y,z)$ is critical, if turning it off will disrupt some control, that is, if there are two distinctive from $(x,y,z)$ CPUs: $(a,b,c)$ and $(d,e,f)$ , such that $(a,b,c)$ controls $(d,e,f)$ before $(x,y,z)$ is turned off and stopped controlling it after the turning off.
输入格式
The first line contains three integers $n$ , $m$ and $k$ ( $1<=n,m,k<=100$ ) — the dimensions of the Super Computer.
Then $n$ blocks follow, describing the current state of the processes. The blocks correspond to the layers of the Super Computer in the order from $1$ to $n$ . Each block consists of $m$ lines, $k$ characters in each — the description of a layer in the format of an $m×k$ table. Thus, the state of the CPU $(x,y,z)$ is corresponded to the $z$ -th character of the $y$ -th line of the block number $x$ . Character "1" corresponds to a working CPU and character "0" corresponds to a malfunctioning one. The blocks are separated by exactly one empty line.
Then $n$ blocks follow, describing the current state of the processes. The blocks correspond to the layers of the Super Computer in the order from $1$ to $n$ . Each block consists of $m$ lines, $k$ characters in each — the description of a layer in the format of an $m×k$ table. Thus, the state of the CPU $(x,y,z)$ is corresponded to the $z$ -th character of the $y$ -th line of the block number $x$ . Character "1" corresponds to a working CPU and character "0" corresponds to a malfunctioning one. The blocks are separated by exactly one empty line.
输出格式
Print a single integer — the number of critical CPUs, that is, such that turning only this CPU off will disrupt some control.
输入输出样例
输入 #1
2 2 3 000 000 111 111
输出 #1
2
输入 #2
3 3 3 111 111 111 111 111 111 111 111 111
输出 #2
19
输入 #3
1 1 10 0101010101
输出 #3
0
In the first sample the whole first layer of CPUs is malfunctional. In the second layer when CPU $(2,1,2)$ turns off, it disrupts the control by CPU $(2,1,3)$ over CPU $(2,1,1)$ , and when CPU $(2,2,2)$ is turned off, it disrupts the control over CPU $(2,2,3)$ by CPU $(2,2,1)$ .
In the second sample all processors except for the corner ones are critical.
In the third sample there is not a single processor controlling another processor, so the answer is $0$ .
In the second sample all processors except for the corner ones are critical.
In the third sample there is not a single processor controlling another processor, so the answer is $0$ .
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted