Codeforces Round 369 (Div. 2)
B
Chris and Magic Square
Codeforces
1400
原题
← AC →
翻译中…

ZS the Coder and Chris the Baboon arrived at the entrance of Udayland. There is a $*n* × *n*$ magic grid on the entrance which is filled with integers. Chris noticed that exactly one of the cells in the grid is empty, and to enter Udayland, they need to fill a positive integer into the empty cell.

翻译中…

Chris tried filling in random numbers but it didn't work. ZS the Coder realizes that they need to fill in a positive integer such that the numbers in the grid form a magic square. This means that he has to fill in a positive integer so that the sum of the numbers in each row of the grid (image), each column of the grid (image), and the two long diagonals of the grid (the main diagonal — image and the secondary diagonal — image) are equal.

翻译中…

Chris doesn't know what number to fill in. Can you help Chris find the correct positive integer to fill in or determine that it is impossible?

翻译中…

Input

翻译中…

The first line of the input contains a single integer $*n*$ ($1 ≤ *n* ≤ 500$) — the number of rows and columns of the magic grid.

翻译中…

$*n*$ lines follow, each of them contains $*n*$ integers. The $*j*$-th number in the $*i*$-th of them denotes $*a*_{*i*, *j*}$ ($1 ≤ *a*_{*i*, *j*} ≤ 10^{9}$ or $*a*_{*i*, *j*} = 0$), the number in the $*i*$-th row and $*j*$-th column of the magic grid. If the corresponding cell is empty, $*a*_{*i*, *j*}$ will be equal to $0$. Otherwise, $*a*_{*i*, *j*}$ is positive.

翻译中…

It is guaranteed that there is exactly one pair of integers $*i*, *j*$ $(1 ≤ *i*, *j* ≤ *n*)$ such that $*a*_{*i*, *j*} = 0$.

翻译中…

Output

翻译中…

Output a single integer, the positive integer $*x*$ ($1 ≤ *x* ≤ 10^{18}$) that should be filled in the empty cell so that the whole grid becomes a magic square. If such positive integer $*x*$ does not exist, output $- 1$ instead.

翻译中…

If there are multiple solutions, you may print any of them.

翻译中…

Note

翻译中…

In the first sample case, we can fill in $9$ into the empty cell to make the resulting grid a magic square. Indeed,

翻译中…

The sum of numbers in each row is:

翻译中…

$4 + 9 + 2 = 3 + 5 + 7 = 8 + 1 + 6 = 15$.

翻译中…

The sum of numbers in each column is:

翻译中…

$4 + 3 + 8 = 9 + 5 + 1 = 2 + 7 + 6 = 15$.

翻译中…

The sum of numbers in the two diagonals is:

翻译中…

$4 + 5 + 6 = 2 + 5 + 8 = 15$.

翻译中…

In the third sample case, it is impossible to fill a number in the empty square such that the resulting grid is a magic square.

翻译中…

样例

Input #1
3
4 0 2
3 5 7
8 1 6
Output #1
9
InputCopy OutputCopy
Input #2
4
1 1 1 1
1 1 0 1
1 1 1 1
1 1 1 1
Output #2
1
InputCopy OutputCopy
Input #3
4
1 1 1 1
1 1 0 1
1 1 2 1
1 1 1 1
Output #3
-1
InputCopy OutputCopy
题目信息
题号
711B
时间限制
2 s
内存限制
256 MB
标签
构造
模拟

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