1016D.Vasya And The Matrix#矩阵存在

题目出处：http://codeforces.com/contest/1016/problem/D

#include<iostream>
#define ll long long int
#define inf 0x3f3f3f3f
#define N 1005
using namespace std;
ll a[N],b[N];
ll xn[N][N];
ll n,m;
int main(){    /**/

    cin>>n>>m;
    ll x = ;
    for(int i=;i<n;i++){
        cin>>a[i];
        x=x^a[i];
    }
    ll y = ;
    for(int i=;i<m;i++){
        cin>>b[i];
        y=y^b[i];
    }

    if(x==y){
        cout<<"YES"<<endl;
    }else{
        cout<<"NO"<<endl;
        return ;
    }
    x = x^a[];
    x = x^b[];
    xn[][] = x;
    for(int i=;i<m;i++)
       xn[][i] = b[i];
    for(int i = ;i<n;i++){
        xn[i][] = a[i];
    }
    for(int i=;i<n;i++){
        for(int j = ;j<m;j++){
            cout<<xn[i][j]<<" ";
        }
        cout<<endl;
    }
    return ;
} 

要使得矩阵存在,那么行和列的异或一定等于零.，或者说行的异或和等于列的异或和.，之后就直接特性的填充。