Codeforces Round #369 (Div. 2) B. 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

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;
typedef __int64 ll;
ll a[510][510];

int main(){
	int n;
	ll x=0;
	ll sum=0,sum1=0,sumTemp=0;
	int posRow=0,posCol=0,flag=0;
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			scanf("%I64d",&a[i][j]);
			if(a[i][j]==0) {
				posRow=i;
				posCol=j;
			}
		}
	}
	if(n==1){
		printf("1\n");
		return 0;
	}
	
	for(int j=1;j<=n;j++){
		sum1+=a[posRow][j];
	}
	
	if(posRow==1){
		for(int j=1;j<=n;j++){
			sum+=a[2][j];
		}
	}
	else{
		for(int j=1;j<=n;j++){
			sum+=a[1][j];
		}
	}
	
		
	
	for(int i=1;i<=n;i++){
		if(i!=posRow){
			sumTemp=0;
			for(int j=1;j<=n;j++){
				sumTemp+=a[i][j];
			}
			if(sumTemp!=sum){
				flag=1;
				break;
			}
		}
		
	}
	if(flag||sum1>=sum){
		printf("-1\n");
	}
	
	else{
		x=sum-sum1;
	
		a[posRow][posCol]=x;
		for(int i=1;i<=n;i++){
			sumTemp=0;
			for(int j=1;j<=n;j++){
				sumTemp+=a[j][i];
			}
			if(sumTemp!=sum){
				flag=1;
				break;	
			}
		}
		
		if(!flag){
		
			sumTemp=0;
			int i=1;
		
			while(i<=n){
				
				sumTemp+=a[i][i];
				i++;
				
				
			
			}
			if(sumTemp!=sum){
				flag=1;
				
			}
			
		
			i=1;
			int j=n;
			sumTemp=0;
			while(j>0){
				sumTemp+=a[i][j];
				i++;j--;
				
			}
			if(sumTemp!=sum){
				flag=1;
				
			}
			
			
		}
		
		
		
		if(flag) {
				printf("-1\n");
				
		}
		else{
			printf("%I64d\n",x);
		}
		
		
		
	}
	
		
	
	
}

题意：在0处填上一个正整数，使得每排每列及对角线和相等；没有则输出-1；

思路：先考虑横向，算出0所在行的和sum1，算出非0行的和sum（我取的是第一行或者第二行），如果sum1>=sum输出-1，计算剩下行的和sumTemp分别与sum比较，不等则输出-1；

再考虑纵向，把结果x=sum-sum1带入矩阵，计算每列和是否与sum相等；

再考虑对角线，两个对角线的和是否与sum相等；

上述只要不想等就标记最后输出-1，都相等输出x；

特殊考虑：n=1；

WA on 11 对角线判断的错误，我是把sum+=a[i][i++]和sum+=a[i][i];i++;等价了；男神说前面一个式子又引用又修改，所以undefined；

WA on 88 依旧对角线，貌似是某条对角线的和小于sum，我一直脑残用大于判断不相等……

基础薄弱啊~