시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
2 초 | 1024 MB | 29 | 0 | 0 | 0.000% |
A magic square is an N × N matrix such that
For example,
8 | 3 | 4 |
1 | 5 | 9 |
6 | 7 | 2 |
Is a 3 × 3 matrix that is a magic square. The three row sums are 8+3+4, 1+5+9, 6+7+2; the three column sums are 8+1+6, 3+5+7, 4+9+2; the two main diagonal sums are 8+5+2, 4+5+6. All these sums are 15.
You are to find out if the remaining entries of a partially filled N N matrix can be completed so that the matrix becomes a magic square.
Example 1. The partially filled matrix
1 | 24 | |||
8 | ||||
9 | ||||
10 | 21 | |||
11 |
can be completed to become
2 | 1 | 18 | 24 | 20 |
25 | 23 | 8 | 4 | 5 |
16 | 9 | 12 | 13 | 15 |
3 | 10 | 21 | 17 | 14 |
19 | 22 | 6 | 7 | 11 |
It can be checked the five row sums, the five column sums, and the two main diagonal sums are all 65. Furthermore, all entries are distinct with values from 1 to 25 inclusively. Thus the given partially filled matrix can become a magic square.
The first line of the input consists of two integers: the first integer N (2 ≤ N ≤ 5) is the number of rows (or columns) of the partially filled matrix, the second integer E is the number of the filled entries of the partially filled matrix. Each of the remaining E lines of the input file consists of three integers with a space between two adjacent integers: the row index R (1 ≤ R ≤ N), the column index C (1 ≤ C ≤ N), and the value V (1 ≤ V ≤ N2) of the filled entry. All the V’s are distinct.
The output contains only one word: “yes” if the given matrix can be completed to become a magic square, “no” otherwise.
5 7 1 4 24 4 2 10 5 5 11 2 3 8 3 2 9 1 2 1 4 3 21
yes