Codeforces Round #438 C - Qualification Rounds 思维

转载于 2017-12-07 14:12:00 发布 · 139 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/mj-liylho/p/7998836.html

探讨如何从已知部分队伍答案的题库中选取题目，确保每个队伍最多只了解一半的题目，通过二进制状态压缩实现高效判断。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Snark and Philip are preparing the problemset for the upcoming pre-qualification round for semi-quarter-finals. They have a bank of nproblems, 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

output

NO

input

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.

题意：现在有k支队伍要参加一个比赛，题库中有n道题目，其中有些队伍已经知道了某些题目，现在给出每道题目每支队伍是否知道的情况，问是否存在一套题目使得所有队伍最多只知道一半的题目。

思路：若有解，则至少有两套题目满足条件,我们只需找到两套题对所有人均满足条件即可。将每套题的状态，用二进制位保存成数字，当两个数字与运算为0则满足条件。

代码：

 1 #include<bits/stdc++.h>
 2 #define db double
 3 #define ll long long
 4 #define vec vector<ll>
 5 #define Mt  vector<vec>
 6 #define ci(x) scanf("%d",&x)
 7 #define cd(x) scanf("%lf",&x)
 8 #define cl(x) scanf("%lld",&x)
 9 #define pi(x) printf("%d\n",x)
10 #define pd(x) printf("%f\n",x)
11 #define pl(x) printf("%lld\n",x)
12 #define rep(i, x, y) for(int i=x;i<=y;i++)
13 const int N   = 1e6 + 5;
14 const int mod = 1e9 + 7;
15 const int MOD = mod - 1;
16 const db  eps = 1e-18;
17 const db  PI  = acos(-1.0);
18 using namespace std;
19 
20 int n,k;
21 int ans=0;
22 int s[20];
23 bool v[20];
24 int main()
25 {
26     cin>>n>>k;
27     for(int i=0;i<n;i++)
28     {
29         int ans=0;
30         for(int j=0;j<k;j++){
31             int x;ci(x);
32             ans+=(1<<j)*x;//二进制保存
33         }
34         v[ans]=1;
35     }
36     for(int i=0;i<16;i++){
37         for(int j=0;j<16;j++){
38             if(v[i]&&v[j]&&!(i&j)) return 0*puts("YES");//存在与运算为0的情况
39         }
40     }
41     puts("NO");
42 }