Codeforces 711B Chris and Magic Square

原创 2016年08月30日 10:16:48

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的方格,中间有一个空白格,判断该格子里添数字几可以使得每行都相等,每列都相等,且两条对角线都相等,若不存在输出-1。

分析:把每行每列都加起来,判断即可,题目中有几个坑,n==1时,输出大于1的任何一个数即可,且任何数据输出的数据大于1.

代码如下(代码比较丑):

#include <stdio.h>
#include <string.h>
long long map[510][510];
long long a[510],b[510];
int main()
{
	int n;
	int i,j;
	int sx=0,sy=0;
	memset(a,0,sizeof(a));
	memset(b,0,sizeof(b));
	scanf("%d",&n);
	for(i=1;i<=n;i++)
	{
		for(j=1;j<=n;j++)
		{
			scanf("%d",map[i]+j);
			a[i]+=map[i][j];
			b[j]+=map[i][j];
			if(map[i][j]==0)
			{
				sx=i;
				sy=j;
			}
		}
	}
	if(n==1)
	{
		printf("1\n");
		return 0;
	}
	long long sum=0;
	if(sx!=1)
		sum=a[1];
	else
		sum=a[2];
		
	int peace=1;
	if(sum-a[sx] == sum-b[sy])
	{
		map[sx][sy]=sum-a[sx];
		
		long long le=0,ri=0;
		a[sx]+=map[sx][sy];
		b[sy]+=map[sx][sy];
		
		for(i=1;i<=n;i++)
		{
			if(a[i]!=sum)
			{
				peace=0;
				break;
			}		
		}
		for(i=1;i<=n &&peace;i++)
		{
			if(b[i]!=sum)
			{
				peace=0;
				break;
			}
		}
		for(i=1;i<=n;i++)
			le+=map[i][i];
		for(i=1;i<=n;i++)
			ri+=map[i][n-i+1];
		if(sum!=le || sum!=ri)
			peace=0;	
		if(peace)
		{
			if(map[sx][sy]>=1)
				printf("%I64d\n",map[sx][sy]);
			else
				printf("-1\n");
		}
		else
			printf("-1\n");
	}
	else
	{
		printf("-1\n");
	}
	
	return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

codeforces 711B. Chris and Magic Square【模拟】

B. Chris and Magic Square time limit per test 2 seconds memory limit per test 256 megaby...
  • Bcwan_
  • Bcwan_
  • 2016年08月29日 23:32
  • 747

Codeforces Problem 711B Chris and Magic Square(constructive algorithms)

Codeforces Problem 711B Chris and Magic Square(constructive algorithms)
  • queuelovestack
  • queuelovestack
  • 2016年08月30日 10:11
  • 959

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 o...
  • qq_35806592
  • qq_35806592
  • 2017年03月22日 20:50
  • 157

CodeForces 711B - Chris and Magic Square

//http://codeforces.com/problemset/problem/711/B //又打了一场掉分赛 这个题最后一定要判断是否小于0 不然会wa7 #include #includ...
  • Katapeltes
  • Katapeltes
  • 2016年08月30日 21:31
  • 169

CodeForces 711B Chris and Magic Square

http://codeforces.com/problemset/problem/711/B #include using namespace std; long ...
  • threeh20
  • threeh20
  • 2017年10月14日 19:28
  • 105

CodeForces - 711B Chris and Magic Square

CodeForces - 711B  Chris and Magic Square    题意:给你一个N*N矩阵,其中0代表未知的那个数,让你在这个位置填上一个数使整个矩阵的 每一行、每一列、...
  • GYH0730
  • GYH0730
  • 2017年09月03日 21:11
  • 71

【模拟】Codeforces 711B Chris and Magic Square

题目链接:   http://codeforces.com/problemset/problem/711/B 题目大意:   N*N的矩阵,有且只有一个0,求要把这个矩阵变成幻方...
  • u010568270
  • u010568270
  • 2016年08月30日 14:51
  • 179

模拟-711B - Chris and Magic Square

题意:给出N,下面N行N列输入。其中有一个位置是0,找出一个正整数使得行列对角线和相等 比赛时候没看到对角线的事WA的惨烈啊 #include #include using namespa...
  • qq_33951440
  • qq_33951440
  • 2016年08月30日 12:56
  • 161

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

codeforces#369Div2BChris and Magic Square
  • qq_17259291
  • qq_17259291
  • 2016年08月30日 21:03
  • 262

Coderforces 711B Chris and Magic Square

模拟题,但是考虑不全面,以后还是要从整体考虑啊。#include #include #include using namespace std; const int maxn=500+10; typed...
  • qq_33901573
  • qq_33901573
  • 2016年08月30日 13:19
  • 102
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Codeforces 711B Chris and Magic Square
举报原因:
原因补充:

(最多只允许输入30个字)