zoukankan      html  css  js  c++  java
  • D. Vasya And The Matrix(Educational Codeforces Round 48)

    D. Vasya And The Matrix
    time limit per test2 seconds
    memory limit per test256 megabytes
    inputstandard input
    outputstandard output
    Now Vasya is taking an exam in mathematics. In order to get a good mark, Vasya needs to guess the matrix that the teacher has constructed!

    Vasya knows that the matrix consists of n rows and m columns. For each row, he knows the xor (bitwise excluding or) of the elements in this row. The sequence a1, a2, ..., an denotes the xor of elements in rows with indices 1, 2, ..., n, respectively. Similarly, for each column, he knows the xor of the elements in this column. The sequence b1, b2, ..., bm denotes the xor of elements in columns with indices 1, 2, ..., m, respectively.

    Help Vasya! Find a matrix satisfying the given constraints or tell him that there is no suitable matrix.

    Input
    The first line contains two numbers n and m (2 ≤ n, m ≤ 100) — the dimensions of the matrix.

    The second line contains n numbers a1, a2, ..., an (0 ≤ ai ≤ 109), where ai is the xor of all elements in row i.

    The third line contains m numbers b1, b2, ..., bm (0 ≤ bi ≤ 109), where bi is the xor of all elements in column i.

    Output
    If there is no matrix satisfying the given constraints in the first line, output "NO".

    Otherwise, on the first line output "YES", and then n rows of m numbers in each ci1, ci2, ... , cim (0 ≤ cij ≤ 2·109) — the description of the matrix.

    If there are several suitable matrices, it is allowed to print any of them.

    直接构造一个任意的(n-1)*(m-1)的0矩阵,最后一个值异或得到

    #include <iostream>
    #include <algorithm>
    #include <string.h>
    #include <stdio.h>
    using namespace std;
    #define ll long long
    int main(int argc, char const *argv[])
    {
        int n, m;
        int r, c;
        int a[105], b[105];
    
        cin >> n >> m;
    
        r = c = 0;
    
        for (int i = 0; i < n; i++) {
            cin >> a[i];
            r ^= a[i];
        }
        for (int i = 0; i < m; i++) {
            cin >> b[i];
            c ^= b[i];
        }
        if (r != c) {
            puts("NO");
        } else {
            bool first;
            puts("YES");
            for (int i = 0; i < n; i++) {
                first = true;
                for (int j = 0; j < m; j++) {
                    if (!first) printf(" ");
                    else first = false;
                    if (i != n-1 && j != m-1) {
                        printf("0");
                    } else if (j == m-1 && i == n-1) {
                        r = 0;
                        for (int k = 0; k < m-1; k++) r ^= b[k];
                        r ^= a[n-1];
                        printf("%d", r);
                    } else if (j == m-1){
                        printf("%d", a[i]);
                    } else {
                        printf("%d", b[j]);
                    }
                }
                printf("
    ");
            }
        }
    
        return 0;
    }
    
    地址 http://sshpark.com.cn/
  • 相关阅读:
    So sad! ,Asphyre Closure
    Asphyre Sphinx is a cross-platform framework for developing 2D/3D video games and interactive business applications
    Mark: admob for delphi xe4 integrated 80% -done!-95% to do more test
    CCBPM新手流程设计教程
    CCBPM 常用API接口说明
    CCBPM H5版本中组织结构集成以及与外部数据源同步介绍
    关于驰骋工作流引擎ccbpm 在工业自动化环境下的应用演示实例
    关于驰骋工作流引擎ccbpm 在工业自动化环境下的 应用演示实例
    CCFlow新版本的自由流程、自定义流程功能说明
    关于驰骋工作流引擎ccbpm对bpmn2.0的支持
  • 原文地址:https://www.cnblogs.com/huangjiaming/p/9420472.html
Copyright © 2011-2022 走看看