300414: CF78E. Evacuation

Memory Limit:256 MB Time Limit:1 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Evacuation

题意翻译

研究站被分成 $n\times n$ 个格子,每个格子是反应堆或实验室,其中一个受感染的反应堆还有 $t$ 分钟爆炸,每一个受感染的格子会在下一分钟感染所有相邻的实验室。每个实验室都有一定数量的科学家和一定数量的救援舱,每个救援舱可以救一名科学家。科学家可以在一分钟内移动到相邻的未感染的实验室。 ##### 输入格式 第一行包含两个整数 $n$ 和 $t$($2 \leq n \leq 10$,$1 \leq t \leq 60$)。接下来 $n$ 行每行 $n$ 个字符,描述科学家的位置,然后是一个空行。接下来 $n$ 行每行 $n$ 个字符,描述救援舱的位置。反应堆在两种描述中位置一致,“Y”表示正常的反应堆,“Z”代表受损的反应堆。在科学家位置的描述中,数字表示相应实验室的科学家人数,在救援舱的描述中,数字代表相应实验室中救援舱的数量。 ##### 输出格式 输出一个整数表示能够逃脱的最大人数。

题目描述

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.

输入输出格式

输入格式


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.

输出格式


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

输入输出样例

输入样例 #1

3 3
1YZ
1YY
100

0YZ
0YY
003

输出样例 #1

2

输入样例 #2

4 4
Y110
1Y1Z
1Y0Y
0100

Y001
0Y0Z
0Y0Y
0005

输出样例 #2

3

说明

In the second sample the events could take place as follows: ![](https://cdn.luogu.com.cn/upload/vjudge_pic/CF78E/e0af98419d22acefe9c08626650854f4a7a67355.png)

Input

题意翻译

研究站被分成 $n\times n$ 个格子,每个格子是反应堆或实验室,其中一个受感染的反应堆还有 $t$ 分钟爆炸,每一个受感染的格子会在下一分钟感染所有相邻的实验室。每个实验室都有一定数量的科学家和一定数量的救援舱,每个救援舱可以救一名科学家。科学家可以在一分钟内移动到相邻的未感染的实验室。 ##### 输入格式 第一行包含两个整数 $n$ 和 $t$($2 \leq n \leq 10$,$1 \leq t \leq 60$)。接下来 $n$ 行每行 $n$ 个字符,描述科学家的位置,然后是一个空行。接下来 $n$ 行每行 $n$ 个字符,描述救援舱的位置。反应堆在两种描述中位置一致,“Y”表示正常的反应堆,“Z”代表受损的反应堆。在科学家位置的描述中,数字表示相应实验室的科学家人数,在救援舱的描述中,数字代表相应实验室中救援舱的数量。 ##### 输出格式 输出一个整数表示能够逃脱的最大人数。

加入题单

算法标签: