codeforces B. Chris and Magic Square

最新推荐文章于 2022-03-15 22:50:47 发布

neversayno_yl

最新推荐文章于 2022-03-15 22:50:47 发布

阅读量242

点赞数

分类专栏： Coderforces & BestCoder

本文链接：https://blog.csdn.net/neversayno_yl/article/details/52434491

版权

Coderforces & BestCoder 专栏收录该内容

41 篇文章 0 订阅

订阅专栏

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 ( $\text{[math]}$ ), each column of the grid ( $\text{[math]}$ ), and the two long diagonals of the grid (the main diagonal — $\text{[math]}$ and the secondary diagonal — $\text{[math]}$ ) 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 ai, j (1 ≤ ai, j ≤ 109 or ai, j = 0), the number in the i-th row and j-th column of the magic grid. If the corresponding cell is empty, ai, j will be equal to 0. Otherwise, ai, j is positive.

It is guaranteed that there is exactly one pair of integers i, j (1 ≤ i, j ≤ n) such that ai, j = 0.

Output

Output a single integer, the positive integer x (1 ≤ x ≤ 1018) 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.

题意：找出0所在位置的数，使得这个举矩阵的行，列和对角线上的值相同，如果不存在，输出-1

思路：开一个val数组来记录这个矩阵的行，列和对角线的和，然后sort排序。如果n为奇数且0的位置在正中间，则必须满足val数组前四个数相等，后面的数相等；如果0的位置在对角线上，则不需满足val前三个数相等，其后的数也相等；如果在其他位置，则必须满足前两个数相等，其后的数也相等；如果都不满足，输出-1；

// 特别注意当val数组里所有数都相等时输出-1

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn = 505;
int map[maxn][maxn];
__int64 val[maxn * maxn];
int main()
{
    int n;
    while(scanf("%d",&n) != EOF)
    {
        int k = 1;
        int xx = -1 , yy = -1;
        memset(val,0,sizeof(val));
        for(int i = 1 ; i <= n ; i++)
        {
            for(int j = 1 ; j <= n ; j++)
            {
                scanf("%d",&map[i][j]);
                if(map[i][j] == 0)
                {
                    xx = i;
                    yy = j;
                }
                val[k] += map[i][j];
            }
            k++;
        }
        if(n == 1 && val[1] == 0){
            printf("1\n");
            continue;
        }
        for(int i = 1 ; i <= n ; i++)
        {
             for(int j = 1 ; j <= n ; j++)
            {
                val[k] += map[j][i];
            }
            k++;
        }
        for(int i = 1 ; i <= n ; i++)
            val[k] += map[i][i];
        k++;
        for(int i = n ; i >= 1 ; i--)
            val[k] += map[i][n+1-i];
        sort(val+1,val+k+1);
        __int64 s = 0;
        if(xx == yy && (n % 2 == 1) && xx == (n+1)/2)
        {
            if(val[1] == val[4] && val[5] == val[k])
               s = max(val[5] - val[1],s);
        }
        else if( xx + yy == n + 1 || xx == yy)
        {
             if(val[1] == val[3] && val[4] == val[k])
               s = max(val[5] - val[1],s);
        }
        else
        {
            if(val[1] == val[2] && val[3] == val[k])
                 s = max(val[5] - val[1],s);
        }
        if(s == 0)
            printf("-1\n");
        else
            printf("%I64d\n",s);
    }
    return 0;
}