Chris and Magic Square(CodeForces - 711B)

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.

Example
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(1<=n<=500)的矩阵 其中有一个的数值为零.要求填入一个数字取代这个零,从而使得每行相等,每列相等,并且两个对角线相等.若不存在一个数填入,使得这个矩阵满足要求,则输出-1;

思路:暴力模拟题给要求,先找出这个零在哪,
如果这个矩阵可以填(意思就是存在一个数使得其满足要求),
那么其他随便一个 非零行(有零存在的那行) 的值就为每行,每列和对角线的标准值.
然后用这个来判断他每行每列 对角线是否相等;

---

**需要注意的是:当n=1时,输入一个0为1*1的矩阵 那么则任何一个满足(1<=x<=1e18)的数都满足题给要求;(卡在第四个样例1 0 十分之难受)
同时 当填入数超出这个范围时(小于1时)也要输出-1;**

---

下面上代码:

#include<stdio.h>
#include<iostream>
#define LL long long
using namespace std;
LL a[555][555];
int main()
{
    LL n,x0,y0,flag;
    while(cin>>n&&n)
    {

        flag=0;

        for(int i=0;i<n;i++)
        {
            for(int j=0;j<n;j++)
            {
                cin>>a[i][j];
                if(a[i][j]==0)//找出0的坐标
                {
                    x0=i;
                    y0=j;
                }
            }
        }

        if(n==1)//特判
        {
            printf("1\n");
            continue;
        }

        LL row0=0;
        for(int i=0;i<n;i++)//取0行的和
            row0+=a[x0][i];

        LL row=0;
        for(int i=0;i<n;i++)//随便取一非0行之和
        {
            if(i!=x0)
            {
                for(int j=0;j<n;j++)
                {
                    row+=a[i][j];
                }
                break;
            }
        }
        a[x0][y0]=row-row0;//先假设为正确值
        //下面验证这个值是否满足题给条件
        LL row_;
        for(int i=0;i<n;i++)
        {
            row_=0;
            for(int j=0;j<n;j++)
                row_+=a[i][j];
            if(row_!=row)//判断每行是否相等
                flag=1;
        }

        LL column;
        for(int j=0;j<n;j++)
        {
            column=0;
            for(int i=0;i<n;i++)
                column+=a[i][j];
            if(column!=row)//判断每列是否相等
                flag=1;
        }

        LL diagonal1=0,diagonal2=0;
        for(int i=0;i<n;i++)//求出对角线
        {
            diagonal1+=a[i][i];
            diagonal2+=a[i][n-i-1];
        }

        if(diagonal1!=row||diagonal2!=row)//判断两条对角线是否相等
            flag=1;

        if(flag==0&&a[x0][y0]>=1&&a[x0][y0]<=1e18)  //注意判断最终值是否在范围内.
            cout<<a[x0][y0]<<endl;
        else
            cout<<"-1"<<endl;
    }
}

ps:,,,代码能力还是太差了…模拟了半天没模拟出来,思路还不够清晰…
个人爆零赛真有意思…
2018-03-30 09:37:07