Codeforces-1016D-Vasya And The Matrix (思维)

题目链接

题意:给出一个N和M,表示这是一个N*M的矩阵,随后给出该矩阵1~N行的异或值a[ ]和1~M行的异或值b[ ],问你是否能构造出这样一个矩阵?

题解:思维题,首先很容易知道若是给出的a[ ]和b[ ]所有值异或得到的不是0,那么一定构造不出来一个矩阵,反之一定可以,那么我们只需要思考的是如何构造,这里分享一种构造方法~

用题目样例举个例子:

我们只需要求一个X就行,因为这里已经确保是YES的情况了,那么X=3^13^2=12或X=9^5=12都行,然后第一行的其他值都是b[ ],第一列的其他值都是a[ ],剩下的值都补0即可,如果不明白为什么可以自己花一下~

代码如下:

#include<iostream>
#include<cstring>
#include<string>
#include<cstdio>
#include<cmath>
#include<vector>
#include<queue>
#include<map>
#include<algorithm>
#include<fstream>
using namespace std;
#define ll long long 
#define inf 0x3f3f3f3f
const int maxn = 1e3 + 100;
ll a[maxn], b[maxn];
int main() {
	int n, m;
	ll s = 0, x = 0;
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++) scanf("%lld", &a[i]), s ^= a[i];
	for (int i = 1; i <= m; i++) {
		scanf("%lld", &b[i]);
		s ^= b[i];
		if (i > 1) x ^= b[i];
	}
	if (s) cout << "NO" << endl;
	else {
		cout << "YES" << endl;
		cout << (x^a[1]) << " ";
		for (int i = 2; i <= m; i++)
			cout << b[i] << " ";
		cout << endl;
		for (int i = 2; i <= n; i++){
			for (int j = 1; j <= m; j++) {
				if (j == 1) cout << a[i] << " ";
				else cout << 0 << " ";
			}
		    cout << endl;
		}
	}
	return 0;
}