시간 제한메모리 제한제출정답맞힌 사람정답 비율
3 초 1024 MB27191770.833%

문제

Egor has table of size $n \times m$, where all lines are numbered from $1$ to $n$ and all columns are numbered from $1$ to $m$. Each cell is painted in some color that can be presented as integer from $1$ to $10^9$.

Let us call the cell that lies in $r$-th row and $c$-th column as $(r, c)$. We define the manhattan distance between two cells $(r_1, c_1)$ and $(r_2, c_2)$ as the length of shortest path between them where each consecutive cells have common side. The path can go through cells of any color. For example, the manhattan distance between $(1, 2)$ and $(3, 3)$ is 3, one of the shortest paths is the following: $(1, 2) \to (2, 2) \to (2, 3) \to (3, 3)$.

Egor decided to calculate the sum of manhattan distances between each pair of cells of same color. Help him to calculate this sum.

입력

The first line contains two integers $n$ and $m$ ($1 \leq n \le m$, $n \cdot m \leq 500\,000$) --- number of rows and columns in the table.

Each of next $n$ lines describes the rows of the table. $i$-th line contains $m$ integers $c_{i1}, c_{i2}, \ldots, c_{im}$ ($1 \le c_{ij} \le 10^9$) --- colors of cells in $i$-th row.

출력

Print one integer --- the the sum of manhattan distances between each pair of cells of same color.

서브태스크

We define $C$ as the maximum number of color in the table.

번호배점제한
123

$n \cdot m \le 1000$

217

$n=1$

315

$n=2$

420

$C \le 2$

525

예제 입력 1

2 3
1 2 3
3 2 1

예제 출력 1

7

예제 입력 2

3 4
1 1 2 2
2 1 1 2
2 2 1 1

예제 출력 2

76

예제 입력 3

4 4
1 1 2 3
2 1 1 2
3 1 2 1
1 1 2 1

예제 출력 3

129

노트

In the first sample there are three pairs of cells of same color: in coordinates $(1, 1)$ and $(2, 3)$, in coordinates $(1, 2)$ and $(2, 2)$, in coordinates $(1, 3)$ and $(2, 1)$. The manhattan distances between them are $3$, $1$ and $3$, the sum is $7$.

채점 및 기타 정보

  • 예제는 채점하지 않는다.
  • 이 문제의 채점 우선 순위는 2이다.