codeforces#369Div2(711B)Chris and Magic Square

题目：

B. Chris and Magic Square

time limit per test:2 seconds
memory limit per test:256 megabytes
input:standard input
output:standard output
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 (), each column of the grid (), and the two long diagonals of the grid (the main diagonal — and the secondary diagonal — ) 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.
Examples
Input
3
4 0 2
3 5 7
8 1 6
Output
9
Input
4
1 1 1 1
1 1 0 1
1 1 1 1
1 1 1 1
Output
1
Input
4
1 1 1 1
1 1 0 1
1 1 2 1
1 1 1 1
Output
-1
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.

题意：
类似幻方，n*n的矩阵其中有一格空着（为0），现在让你找到一个正整数满足每一行，每一列，两条对角线和都相等，找不到输出-1

题解：
这道题挺简单的，纯模拟，先判断没有空格子的行、列是否相等，相等后再判断有空格子的地方是否和也相等，注意填的数一定是>=1的

代码：

//我写的代码有点冗长，实际上有些地方可以缩行
#include<iostream>
#include<cstdio>
using namespace std;
const int N=505;
struct node
{
    int x,y;
}rec;
long long a[N][N];
int main()
{
    int n,i,j;
    long long s,ans=-1,x;
    cin>>n;
    if(n==1)
    {
        cout<<1;
        return 0;
    }
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
        {
            cin>>a[i][j];
            if(a[i][j]==0)
                rec.x=i,rec.y=j;
        }
    for(i=1;i<=n;i++)
    {
        s=0;
        if(rec.x==i)
            continue;
        for(j=1;j<=n;j++)
            s+=a[i][j];
        if(ans==-1)
            ans=s;
        else
            if(ans!=s)
            {
                cout<<"-1";
                return 0;
            }
    }
    for(j=1;j<=n;j++)
    {
        s=0;
        if(rec.y==j)
            continue;
        for(i=1;i<=n;i++)
            s+=a[i][j];
        if(ans==-1)
            ans=s;
        else
            if(ans!=s)
            {
                cout<<"-1";
                return 0;
            }
    }
    s=0;
    for(j=1;j<=n;j++)
        s+=a[rec.x][j];
    x=ans-s;
    if(x<=0)
    {
        cout<<"-1";
        return 0;
    }
    a[rec.x][rec.y]=x;
    s=0;
    for(i=1;i<=n;i++)
        s+=a[i][rec.y];
    if(s!=ans)
    {
        cout<<"-1";
        return 0;
    }
    s=0;
    for(i=1;i<=n;i++)
        s+=a[i][n-i+1];
    if(s!=ans)
    {
        cout<<"-1";
        return 0;
    }
    s=0;
    for(i=1;i<=n;i++)
        s+=a[i][i];
    if(s!=ans)
    {
        cout<<"-1";
        return 0;
    }
    cout<<x;
    return 0;
}