Codeforces Beta Round 81
D
Entertaining Geodetics
Codeforces
2700
原题
← CE →
翻译中…

The maps in the game are divided into square cells called Geo Panels. Some of these panels are painted. We shall assume that the Geo Panels without color are painted the transparent color.

翻译中…

Besides, the map has so-called Geo Symbols. They look like pyramids of different colors (including Geo Symbols of the transparent color). Each Geo Symbol is located on one Geo Panel, and each Geo Panel may contain no more than one Geo Symbol.

翻译中…

Geo Symbols can be eliminated. To understand better what happens when a Geo Symbol is eliminated, let us introduce some queue to which we will put the recently eliminated Geo Symbols.

翻译中…

Let's put at the head of the queue a Geo Symbol that was eliminated just now. Next, we will repeat the following operation:

翻译中…

Extract the Geo Symbol from the queue. Look at the color of the panel containing the given Geo Symbol. If it differs from transparent and differs from the color of the Geo Symbol, then all Geo Panels of this color are repainted in the color of the given Geo Symbol (transparent Geo Symbols repaint the Geo Panels transparent). Repainting is executed in an infinite spiral strictly in the following order starting from the panel, which contained the Geo Symbol:

翻译中…

image

翻译中…

In other words, we select all the panels that need to be repainted and find their numbers in the infinite spiral whose center is placed in the position of the given Geo Symbol. After that, we repaint them in the order of the number's increasing.

翻译中…

If a panel contains another Geo Symbol and this panel is being repainted, then the Geo Symbol is removed from the field and placed at the tail of the queue.

翻译中…

After repainting the Geo Symbol is completely eliminated and the next Geo Symbol is taken from the head of the queue (if there is any) and the process repeats. The process ends if the queue is empty.

翻译中…

See the sample analysis for better understanding.

翻译中…

You know the colors of all the Geo Panels and the location of all the Geo Symbols. Determine the number of repaintings, which will occur if you destroy one of the Geo Symbols.

翻译中…

Input

翻译中…

The first line contains two integers $*n*$ and $*m*$ ($1 ≤ *n*, *m* ≤ 300$) — the height and the width of the map (in cells).

翻译中…

Then follow $*n*$ line; each of them contains $*m*$ numbers — the Geo Panels' colors.

翻译中…

Then follow $*n*$ more lines; each of them contains $*m*$ numbers — the Geo Symbols' description. -1 means that the given position contains no Geo Symbol. Otherwise, the number represents the color of the Geo Symbol in the given position.

翻译中…

All colors are integers from $0$ to $10^{9}$. $0$ represents the transparent color.

翻译中…

The last line contains two integers $*x*$ and $*y*$ ($1 ≤ *x* ≤ *n*$, $1 ≤ *y* ≤ *m*$) — the row and the column where the Geo Symbol is placed that needs to be eliminated. The rows are numbered from top to bottom, the columns are numbered from left to right. Coordinates are 1-based. It is guaranteed that the position with coordinates $(*x*, *y*)$ contains a Geo Symbol.

翻译中…

Output

翻译中…

Print the single number — the total number of repaintings after the Geo Symbol is eliminated.

翻译中…

Please, do not use the %lld specificator to read or write 64-bit integers in C++. It is preferred to use the cout stream (you may also use the %I64d specificator).

翻译中…

Note

翻译中…

All actions of the sample you can see on the following picture:

翻译中…

image

翻译中…

If your browser does not support APNG and you see just static image, you can see GIF version of this image by the following link:

翻译中…

样例

Input #1
5 5
9 0 1 1 0
0 0 3 2 0
1 1 1 3 0
1 1 1 3 0
0 1 2 0 3
-1 1 -1 3 -1
-1 -1 -1 0 -1
-1 -1 -1 -1 -1
-1 2 3 -1 -1
-1 -1 -1 -1 2
4 2
Output #1
35
InputCopy OutputCopy
题目信息
题号
105D
时间限制
1 s
内存限制
256 MB
标签
暴力
并查集
模拟

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