C. Qualification Rounds

C. Qualification Rounds
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard 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

In the first example you can't make any interesting problemset, because the first team knows all problems.

In the second example you can choose the first and the third problems.

 

下面是借用别人的解释，一个数学结论。再附上自己看了之后写的代码。

【题意】给定n个问题和K个人，给定每个人知道的问题列表，求能否找到一个非空问题集合，满足每个人知道的集合中问题数量都不超过集合总题数的一半。n<=10^5,k<=4。

【算法】数学结论

【题解】当k<=4时，结论：若存在合法方案，则一定存在选择2个问题的合法方案。

证明：对于选择偶数个问题的合法方案（奇数不优），假设方案中每个人都知道一半问题（最坏），试图从中得到选择2个问题的合法方案。

先得到三条易证的结论：

Ⅰ两个人知道区间互补，则找不到问题满足这两个人都不知道。

Ⅱ否则，至少存在一个问题满足这两个人都不知道。

Ⅲ多个人知道区间一致，则至少存在一个问题满足这多个人都不知道。

①若不存在Ⅰ，则把4个人分成2组，每组内由Ⅱ可得1个问题。如果2个问题一致说明这两人对应那两人区间分别一致，由Ⅲ可知交换搭档即可。

②若存在Ⅰ，则把互补分到不同组。若一个人和另外三个人都互补，另外三个人由Ⅲ得到1个问题，一个人再得到1个问题。

 

 1 #include <iostream>
 2 #define N 100005
 3 using namespace std;
 4 int n,m,x;
 5 int dp[16];
 6 int main(){
 7   cin>>n>>m;
 8   for(int i=0;i<n;i++){
 9     int p=0;
10     for(int j=0;j<m;j++){
11       cin>>x;
12       p=(p<<1)+x;
13     }
14     dp[p]++;
15   }
16   for(int i=0;i<16;i++){
17     for(int j=i;j<16;j++){
18       if(dp[i]&&dp[j]&&((i&j)==0)){
19         cout<<"YES"<<endl;
20         return 0;
21       }
22     }
23   }
24   cout<<"NO"<<endl;
25   return 0;
26 }

 

posted @ 2017-10-10 15:55  #忘乎所以#  阅读(280)  评论(0)  编辑  收藏  举报