Codeforces Beta Round 70 (Div. 2)
E
Evacuation
Codeforces
2300
原题
← D→
翻译中…

They've screwed something up yet again... In one nuclear reactor of a research station an uncontrolled reaction is in progress and explosion which will destroy the whole station will happen soon.

翻译中…

The station is represented by a square $*n* × *n*$ divided into $1 × 1$ blocks. Each block is either a reactor or a laboratory. There can be several reactors and exactly one of them will explode soon. The reactors can be considered impassable blocks, but one can move through laboratories. Between any two laboratories, which are in adjacent blocks, there is a corridor. Blocks are considered adjacent if they have a common edge.

翻译中…

In each laboratory there is some number of scientists and some number of rescue capsules. Once the scientist climbs into a capsule, he is considered to be saved. Each capsule has room for not more than one scientist.

翻译中…

The reactor, which is about to explode, is damaged and a toxic coolant trickles from it into the neighboring blocks. The block, which contains the reactor, is considered infected. Every minute the coolant spreads over the laboratories through corridors. If at some moment one of the blocks is infected, then the next minute all the neighboring laboratories also become infected. Once a lab is infected, all the scientists there that are not in rescue capsules die. The coolant does not spread through reactor blocks.

翻译中…

There are exactly $*t*$ minutes to the explosion. Any scientist in a minute can move down the corridor to the next lab, if it is not infected. On any corridor an unlimited number of scientists can simultaneously move in both directions. It is believed that the scientists inside a lab moves without consuming time. Moreover, any scientist could get into the rescue capsule instantly. It is also believed that any scientist at any given moment always has the time to perform their actions (move from the given laboratory into the next one, or climb into the rescue capsule) before the laboratory will be infected.

翻译中…

Find the maximum number of scientists who will be able to escape.

翻译中…

Input

翻译中…

The first line contains two integers $*n*$ and $*t*$ ($2 ≤ *n* ≤ 10$, $1 ≤ *t* ≤ 60$). Each of the next $*n*$ lines contains $*n*$ characters. These lines describe the scientists' locations. Then exactly one empty line follows. Each of the next $*n*$ more lines contains $*n*$ characters. These lines describe the rescue capsules' locations.

翻译中…

In the description of the scientists' and the rescue capsules' locations the character "Y" stands for a properly functioning reactor, "Z" stands for the malfunctioning reactor. The reactors' positions in both descriptions coincide. There is exactly one malfunctioning reactor on the station. The digits "0" - "9" stand for the laboratories. In the description of the scientists' locations those numbers stand for the number of scientists in the corresponding laboratories. In the rescue capsules' descriptions they stand for the number of such capsules in each laboratory.

翻译中…

Output

翻译中…

Print a single number — the maximum number of scientists who will manage to save themselves.

翻译中…

Note

翻译中…

In the second sample the events could take place as follows:

翻译中…

image

翻译中…

样例

Input #1
3 3
1YZ
1YY
100

0YZ
0YY
003
Output #1
2
InputCopy OutputCopy
Input #2
4 4
Y110
1Y1Z
1Y0Y
0100

Y001
0Y0Z
0Y0Y
0005
Output #2
3
InputCopy OutputCopy
题目信息
题号
78E
时间限制
1 s
内存限制
256 MB
标签
网络流
图论
最短路

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。