codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

711B.md (3155B)


      1 Source: https://codeforces.com/problemset/problem/711/B
      2 
      3 B. Chris and Magic Square
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 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.
     22 
     23 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 (![](https://espresso.codeforces.com/84d9c6e32ef1298cc936c35b0131ab75b15f947c.png)), each column of the grid (![](https://espresso.codeforces.com/6d6585d1d6716c49d59de38fbfa9c3f112c4fb13.png)), and the two long diagonals of the grid (the main diagonal — ![](https://espresso.codeforces.com/3b14e61ddae8941322273d61538786b273ba87bf.png) and the secondary diagonal — ![](https://espresso.codeforces.com/0831b5f2c141c2973dca669d78fe949ba67b5b12.png)) are equal.
     24 
     25 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?
     26 
     27 Input
     28 
     29 The first line of the input contains a single integer *n* (1 ≤ *n* ≤ 500) — the number of rows and columns of the magic grid.
     30 
     31 *n* lines follow, each of them contains *n* integers. The *j*-th number in the *i*-th of them denotes *a**i*, *j* (1 ≤ *a**i*, *j* ≤ 109 or *a**i*, *j* = 0), the number in the *i*-th row and *j*-th column of the magic grid. If the corresponding cell is empty, *a**i*, *j* will be equal to 0. Otherwise, *a**i*, *j* is positive.
     32 
     33 It is guaranteed that there is exactly one pair of integers *i*, *j* (1 ≤ *i*, *j* ≤ *n*) such that *a**i*, *j* = 0.
     34 
     35 Output
     36 
     37 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.
     38 
     39 If there are multiple solutions, you may print any of them.
     40 
     41 Examples
     42 
     43 Input
     44 
     45 ```
     46 3  
     47 4 0 2  
     48 3 5 7  
     49 8 1 6
     50 ```
     51 
     52 Output
     53 
     54 ```
     55 9
     56 ```
     57 
     58 Input
     59 
     60 ```
     61 4  
     62 1 1 1 1  
     63 1 1 0 1  
     64 1 1 1 1  
     65 1 1 1 1
     66 ```
     67 
     68 Output
     69 
     70 ```
     71 1
     72 ```
     73 
     74 Input
     75 
     76 ```
     77 4  
     78 1 1 1 1  
     79 1 1 0 1  
     80 1 1 2 1  
     81 1 1 1 1
     82 ```
     83 
     84 Output
     85 
     86 ```
     87 -1
     88 ```
     89 
     90 Note
     91 
     92 In the first sample case, we can fill in 9 into the empty cell to make the resulting grid a magic square. Indeed,
     93 
     94 The sum of numbers in each row is:
     95 
     96 4 + 9 + 2 = 3 + 5 + 7 = 8 + 1 + 6 = 15.
     97 
     98 The sum of numbers in each column is:
     99 
    100 4 + 3 + 8 = 9 + 5 + 1 = 2 + 7 + 6 = 15.
    101 
    102 The sum of numbers in the two diagonals is:
    103 
    104 4 + 5 + 6 = 2 + 5 + 8 = 15.
    105 
    106 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.