CF1438 C. Engineer Artem

Artem is building a new robot. He has a matrix a consisting of n rows and m columns. The cell located on the i-th row from the top and the j-th column from the left has a value ai,j written in it.

If two adjacent cells contain the same value, the robot will break. A matrix is called good if no two adjacent cells contain the same value, where two cells are called adjacent if they share a side.

Artem wants to increment the values in some cells by one to make a good.

More formally, find a good matrix b that satisfies the following condition —

For all valid (i,j), either bi,j=ai,j or bi,j=ai,j+1.
For the constraints of this problem, it can be shown that such a matrix b always exists. If there are several such tables, you can output any of them. Please note that you do not have to minimize the number of increments.

Input
Each test contains multiple test cases. The first line contains the number of test cases t (1≤t≤10). Description of the test cases follows.

The first line of each test case contains two integers n,m (1≤n≤100, 1≤m≤100) — the number of rows and columns, respectively.

The following n lines each contain m integers. The j-th integer in the i-th line is ai,j (1≤ai,j≤109).

Output
For each case, output n lines each containing m integers. The j-th integer in the i-th line is bi,j.

Example
input
3
3 2
1 2
4 5
7 8
2 2
1 1
3 3
2 2
1 3
2 2
output
1 2
5 6
7 8
2 1
4 3
2 4
3 2
Note
In all the cases, you can verify that no two adjacent cells have the same value and that b is the same as a with some values incremented by one.

题意
给你一个n，m的矩阵，使所有元素与相邻元素互不相同，每个元素只能加一或不变，输出最后满足条件的矩阵。

思路
构造成一个矩阵如下：
奇偶奇偶奇偶
偶奇偶奇偶奇
奇偶奇偶奇偶
偶奇偶奇偶奇

代码

#include <bits/stdc++.h>
typedef long long ll;
const ll mod =1e9 + 7;
using namespace std;
namespace fastIO {
    inline void input(int& res) {
        char c = getchar();res = 0;int f = 1;
        while (!isdigit(c)) { f ^= c == '-'; c = getchar(); }
        while (isdigit(c)) { res = (res << 3) + (res << 1) + (c ^ 48);c = getchar(); }
        res = f ? res : -res;
    }
    inline ll qpow(ll a, ll b) {
        ll ans = 1, base = a;
        while (b) {
            if (b & 1) ans = (ans * base % mod +mod )%mod;
            base = (base * base % mod + mod)%mod;
            b >>= 1;
        }
        return ans;
    }
}
using namespace fastIO;
const int N = 1e6+5;
int Case,n,m;
int a;
int main(){
	Case=1;
	input(Case);
	while(Case--){
		input(n),input(m);
		for(int i = 1;i <= n;i++){
			for(int j = 1;j <= m;j++){
				input(a);
				if((i+j)%2==0&&a%2==0) a++;
				if((i+j)%2==1&&a%2==1) a++;
				printf("%d ",a); 
			}
			puts("");
		}		
	}
	return 0;
}
/*
100
4 4
1 2 3 4
1 2 3 4
3 3 3 3
3 3 3 3
*/