CF1157G.Inverse of Rows and Columns

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

You are given a binary matrix aa of size n×mn \times m . A binary matrix is a matrix where each element is either 00 or 11 .

You may perform some (possibly zero) operations with this matrix. During each operation you can inverse the row of this matrix or a column of this matrix. Formally, inverting a row is changing all values in this row to the opposite ( 00 to 11 , 11 to 00 ). Inverting a column is changing all values in this column to the opposite.

Your task is to sort the initial matrix by some sequence of such operations. The matrix is considered sorted if the array [a1,1,a1,2,,a1,m,a2,1,a2,2,,a2,m,,an,m1,an,m][a_{1, 1}, a_{1, 2}, \dots, a_{1, m}, a_{2, 1}, a_{2, 2}, \dots, a_{2, m}, \dots, a_{n, m - 1}, a_{n, m}] is sorted in non-descending order.

输入格式

The first line of the input contains two integers nn and mm ( 1n,m2001 \le n, m \le 200 ) — the number of rows and the number of columns in the matrix.

The next nn lines contain mm integers each. The jj -th element in the ii -th line is ai,ja_{i, j} ( 0ai,j10 \le a_{i, j} \le 1 ) — the element of aa at position (i,j)(i, j) .

输出格式

If it is impossible to obtain a sorted matrix, print "NO" in the first line.

Otherwise print "YES" in the first line. In the second line print a string rr of length nn . The ii -th character rir_i of this string should be '1' if the ii -th row of the matrix is inverted and '0' otherwise. In the third line print a string cc of length mm . The jj -th character cjc_j of this string should be '1' if the jj -th column of the matrix is inverted and '0' otherwise. If there are multiple answers, you can print any.

输入输出样例

  • 输入#1

    2 2
    1 1
    0 1
    

    输出#1

    YES
    00
    10
    
  • 输入#2

    3 4
    0 0 0 1
    0 0 0 0
    1 1 1 1
    

    输出#2

    YES
    010
    0000
    
  • 输入#3

    3 3
    0 0 0
    1 0 1
    1 1 0
    

    输出#3

    NO
    
首页