本站作为LDUOnlineJudge的测试版本进行演示,官方网站请访问http://icpc.ldu.edu.cn
[Hidden ☆ before use]

1194. D. Matrix Transformation


Description

You have an integer matrix A, with R rows and C columns. That means it has R rows with each
row containing C integers. Two integers are adjacent if their container cells share an edge. For
example, in the following grid

(0, 1), (4, 5), (1, 4), (5, 2) are adjacent but (0, 4), (2, 6), (5, 7) are not adjacent.
You are allowed to do only one kind of operation in the matrix. In each step you will select two
adjacent cells and increase or decrease those two adjacent values by 1, i.e., both values are
increased by 1 or both values are decreased by 1.
The Problem:
Given a matrix, determine whether it is possible to transform it to a zero matrix by applying the
allowed operations. A zero matrix is the one where each of its entries is zero.

Input

The first input line contains a positive integer, n, indicating the number of matrices. Each matrix
starts with a line containing R (2 ≤ R ≤ 30) and C (2 ≤ C ≤ 30) separated by a single space. Each
of the next R lines contains C integers. Each of these integers is between -20 and +20 inclusive.
Assume that each input matrix will have at least one non-zero value.

Output

For each matrix (test case), first output “Case #i:” where i is the test case number, starting
with 1. Then output “YES” if you can transform it to a zero matrix or “NO” otherwise. Leave a
blank line after the output for each test case. Follow the format illustrated in Sample Output.

Samples

Input Copy
6
3 3
-2 2 2
1 1 0
2 -2 -2
3 3
-1 0 1
-2 -1 1
0 1 2
3 3
-1 0 1
0 2 -1
-1 1 2
3 3
-1 2 1
-1 -1 -3
1 1 -1
2 3
0 -2 3
1 3 1
2 3
3 1 1
2 0 1
Output
Case #1: YES

Case #2: NO

Case #3: NO

Case #4: YES

Case #5: NO

Case #6: YES

Source

UCF2011
Problem Information

Time Limit: 1000MS (C/C++,Others×2)
Memory Limit: 128MB (C/C++,Others×2)
Special Judge: No
AC/Submit: 1 / 1
Tags:
Contests involved

1023. UCF 2011
My history solutions

You didn't submit any solution!
Submit your solution

Login Register