CF509D.Restoring Numbers

普及/提高-

通过率:0%

AC君温馨提醒

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

题目描述

Vasya had two arrays consisting of non-negative integers: aa of size nn and bb of size mm . Vasya chose a positive integer kk and created an n×mn×m matrix vv using the following formula:

Vasya wrote down matrix vv on a piece of paper and put it in the table.

A year later Vasya was cleaning his table when he found a piece of paper containing an n×mn×m matrix ww . He remembered making a matrix one day by the rules given above but he was not sure if he had found the paper with the matrix vv from those days. Your task is to find out if the matrix ww that you've found could have been obtained by following these rules and if it could, then for what numbers k,a1,a2,...,an,b1,b2,...,bmk,a_{1},a_{2},...,a_{n},b_{1},b_{2},...,b_{m} it is possible.

输入格式

The first line contains integers nn and mm ( 1<=n,m<=1001<=n,m<=100 ), separated by a space — the number of rows and columns in the found matrix, respectively.

The ii -th of the following lines contains numbers wi,1,wi,2,...,wi,mw_{i,1},w_{i,2},...,w_{i,m} ( 0<=wi,j<=1090<=w_{i,j}<=10^{9} ), separated by spaces — the elements of the ii -th row of matrix ww .

输出格式

If the matrix ww could not have been obtained in the manner described above, print "NO" (without quotes) in the single line of output.

Otherwise, print four lines.

In the first line print "YES" (without quotes).

In the second line print an integer kk ( 1<=k<=10181<=k<=10^{18} ). Note that each element of table ww should be in range between 00 and k1k-1 inclusively.

In the third line print nn integers a1,a2,...,ana_{1},a_{2},...,a_{n} ( 0<=ai<=10180<=a_{i}<=10^{18} ), separated by spaces.

In the fourth line print mm integers b1,b2,...,bmb_{1},b_{2},...,b_{m} ( 0<=bi<=10180<=b_{i}<=10^{18} ), separated by spaces.

输入输出样例

  • 输入#1

    2 3
    1 2 3
    2 3 4
    

    输出#1

    YES
    1000000007
    0 1 
    1 2 3 
  • 输入#2

    2 2
    1 2
    2 0
    

    输出#2

    YES
    3
    0 1 
    1 2 
  • 输入#3

    2 2
    1 2
    2 1
    

    输出#3

    NO
    

说明/提示

By we denote the remainder of integer division of bb by cc .

It is guaranteed that if there exists some set of numbers k,a1,...,an,b1,...,bmk,a_{1},...,a_{n},b_{1},...,b_{m} , that you could use to make matrix ww , then there also exists a set of numbers that meets the limits 1<=k<=10181<=k<=10^{18} , 1<=ai<=10181<=a_{i}<=10^{18} , 1<=bi<=10181<=b_{i}<=10^{18} in the output format. In other words, these upper bounds are introduced only for checking convenience purposes.

首页