Codeforces Round 539 (Div. 1)
F
Sasha and Algorithm of Silence's Sounds
Codeforces
3200
原题
← E→
翻译中…

One fine day Sasha went to the park for a walk. In the park, he saw that his favorite bench is occupied, and he had to sit down on the neighboring one. He sat down and began to listen to the silence. Suddenly, he got a question: what if in different parts of the park, the silence sounds in different ways? So it was. Let's divide the park into $1 \times 1$ meter squares and call them cells, and numerate rows from $1$ to $n$ from up to down, and columns from $1$ to $m$ from left to right. And now, every cell can be described with a pair of two integers $(x, y)$, where $x$ — the number of the row, and $y$ — the number of the column. Sasha knows that the level of silence in the cell $(i, j)$ equals to $f_{i,j}$, and all $f_{i,j}$ form a permutation of numbers from $1$ to $n \cdot m$. Sasha decided to count, how many are there pleasant segments of silence?

翻译中…

Let's take some segment $[l \ldots r]$. Denote $S$ as the set of cells $(i, j)$ that $l \le f_{i,j} \le r$. Then, the segment of silence $[l \ldots r]$ is pleasant if there is only one simple path between every pair of cells from $S$ (path can't contain cells, which are not in $S$). In other words, set $S$ should look like a tree on a plain. Sasha has done this task pretty quickly, and called the algorithm — "algorithm of silence's sounds".

翻译中…

Time passed, and the only thing left from the algorithm is a legend. To prove the truthfulness of this story, you have to help Sasha and to find the number of different pleasant segments of silence. Two segments $[l_1 \ldots r_1]$, $[l_2 \ldots r_2]$ are different, if $l_1 \neq l_2$ or $r_1 \neq r_2$ or both at the same time.

翻译中…

Input

翻译中…

The first line contains two integers $n$ and $m$ ($1 \le n, m \le 1000$, $1 \le n \cdot m \le 2 \cdot 10^5$) — the size of the park.

翻译中…

Each from next $n$ lines contains $m$ integers $f_{i,j}$ ($1 \le f_{i,j} \le n \cdot m$) — the level of silence in the cell with number $(i, j)$.

翻译中…

It is guaranteed, that all $f_{i,j}$ are different.

翻译中…

Output

翻译中…

Print one integer — the number of pleasant segments of silence.

翻译中…

Note

翻译中…

In the first example, all segments of silence are pleasant.

翻译中…

In the second example, pleasant segments of silence are the following:

翻译中…

image

翻译中…

样例

Input #1
1 5
1 2 3 4 5
Output #1
15
InputCopy OutputCopy
Input #2
2 3
1 2 3
4 5 6
Output #2
15
InputCopy OutputCopy
Input #3
4 4
4 3 2 16
1 13 14 15
5 7 8 12
6 11 9 10
Output #3
50
InputCopy OutputCopy
题目信息
题号
1109F
时间限制
1.5 s
内存限制
256 MB
标签
数据结构
树

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