CF1492E.Almost Fault-Tolerant Database
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
You are storing an integer array of length m in a database. To maintain internal integrity and protect data, the database stores n copies of this array.
Unfortunately, the recent incident may have altered the stored information in every copy in the database.
It's believed, that the incident altered at most two elements in every copy. You need to recover the original array based on the current state of the database.
In case there are multiple ways to restore the array, report any. If there is no array that differs from every copy in no more than two positions, report that as well.
输入格式
The first line contains integers n and m ( 2≤n ; 1≤m ; n⋅m≤250000 ) — the number of copies and the size of the array.
Each of the following n lines describes one of the currently stored copies in the database, it consists of m integers si,1,si,2,…,si,m ( 1≤si,j≤109 ).
输出格式
If there is an array consistent with all given copies, print "Yes" and then the array itself. The array must have length m and contain integers between 1 and 109 only.
Otherwise, print "No".
If there are multiple possible arrays, print any of them.
输入输出样例
输入#1
3 4 1 10 10 100 1 1 1 100 10 100 1 100
输出#1
Yes 1 10 1 100
输入#2
10 7 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 2 2 1 1 1 1 2 2 1 1 1 1 2 2 1 1 1 1 2 2 1 1 1 1 2 2 1 1 1 1 2 2 1 1 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1
输出#2
Yes 1 1 1 1 1 1 1
输入#3
2 5 2 2 1 1 1 1 1 2 2 2
输出#3
No
说明/提示
In the first example, the array [1,10,1,100] differs from first and second copies in just one position, and from the third copy in two positions.
In the second example, array [1,1,1,1,1,1,1] is the same as the first copy and differs from all other copies in at most two positions.
In the third example, there is no array differing in at most two positions from every database's copy.