Codeforces Round #438 C. Qualification Rounds 题解

最新推荐文章于 2023-04-08 11:00:02 发布

MaverickFW

最新推荐文章于 2023-04-08 11:00:02 发布

阅读量361

点赞数

文章标签： codeforces

本文链接：https://blog.csdn.net/MaverickFW/article/details/78198184

版权

博客介绍了Snark和Philip在准备预选拔赛的问题集，需要从n个问题中选择一部分，使得k支经验丰富的队伍每队最多只知道一半。输入包含问题数量n和队伍数量k，以及每队对每个问题的了解情况。如果可以创建一个有趣的问题集则输出'YES'，否则输出'NO'。示例中解释了如何判断是否可能创建这样的问题集。

摘要由CSDN通过智能技术生成

C. Qualification Rounds
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
Snark and Philip are preparing the problemset for the upcoming pre-qualification round for semi-quarter-finals. They have a bank of n problems, and they want to select any non-empty subset of it as a problemset.

k experienced teams are participating in the contest. Some of these teams already know some of the problems. To make the contest interesting for them, each of the teams should know at most half of the selected problems.

Determine if Snark and Philip can make an interesting problemset!

Input
The first line contains two integers n, k (1 ≤ n ≤ 105, 1 ≤ k ≤ 4) — the number of problems and the number of experienced teams.

Each of the next n lines contains k integers, each equal to 0 or 1. The j-th number in the i-th line is 1 if j-th team knows i-th problem and 0 otherwise.

Output
Print “YES” (quotes for clarity), if it is possible to make an interesting problemset, and “NO” otherwise.

You can print each character either upper- or lowercase (“YeS” and “yes” are valid when the answer is “YES”).

Examples
input
5 3
1 0 1
1 1 0
1 0 0
1 0 0
1 0 0
output
NO
input
3 2
1 0
1 1
0 1
output
YES
Note