B. Almost Ternary Matrix（构造/思维）

题目

题意

给定n,m的二维矩阵，现在要求构造n,m的01矩阵，使得该矩阵，任意一个点，相邻的点中，有2个节点和它不同编号。
其中n,m都是偶数

思路

构造以下这两种2*2矩阵，交替填充即可。

	{
		{1, 0}, 
		{0, 1}
	},
	{ 
		{0, 1},
		{1, 0}
	}

代码

#include <bits/stdc++.h> 
using namespace std;
#define ll long long

int n, m; 
vector<vector<vector<int>>> units = {
	{
		{1, 0}, 
		{0, 1}
	},
	{ 
		{0, 1},
		{1, 0}
	}
};
int a[55][55];
void cal(int r, int c, int pos) {
	for (int i = 0; i < 2; ++i) {
		for (int j = 0; j < 2; ++j) {
			a[r+i][c+j] = units[pos][i][j];
		}
	}
}
void solve() {
	scanf("%d%d", &n, &m);
	for (int row = 0, r = 0; row < n; row += 2) {
		
		for (int col = 0, c = 0; col < m; col += 2) {
			cal(row, col, (r + c) % 2);
			c++;
		}
		r++;
	}
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < m; ++j) {
			printf("%d ", a[i][j]);
		}
		printf("\n");
	}
}

int main() {
	int t;
	scanf("%d", &t);
	while (t--) {
		solve();
	}
}