Codeforces 985B 水题

B. Switches and Lamps

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given n switches and m lamps. The i-th switch turns on some subset of the lamps. This information is given as the matrix aconsisting of n rows and m columns where ai, j = 1 if the i-th switch turns on the j-th lamp and ai, j = 0 if the i-th switch is not connected to the j-th lamp.

Initially all m lamps are turned off.

Switches change state only from "off" to "on". It means that if you press two or more switches connected to the same lamp then the lamp will be turned on after any of this switches is pressed and will remain its state even if any switch connected to this lamp is pressed afterwards.

It is guaranteed that if you push all n switches then all m lamps will be turned on.

Your think that you have too many switches and you would like to ignore one of them.

Your task is to say if there exists such a switch that if you will ignore (not use) it but press all the other n - 1 switches then all the m lamps will be turned on.

Input

The first line of the input contains two integers n and m (1 ≤ n, m ≤ 2000) — the number of the switches and the number of the lamps.

The following n lines contain m characters each. The character ai, j is equal to '1' if the i-th switch turns on the j-th lamp and '0' otherwise.

It is guaranteed that if you press all n switches all m lamps will be turned on.

Output

Print "YES" if there is a switch that if you will ignore it and press all the other n - 1 switches then all m lamps will be turned on. Print "NO" if there is no such switch.

Examples

input

Copy

4 5
10101
01000
00111
10000

output

Copy

YES

input

Copy

4 5
10100
01000
00110
00101

output

Copy

NO

题意：给n盏灯，m个开关，每次按开关只能将灯从灯灭的状态转变为灯亮，问是否存在不按所有开关就将所有灯打开的方法。

思路：模拟。先统计每个灯有几个开关控制，然后访问所有开关，找是否存在一个开关，他控制的每盏灯均由至少两个开关控制。若存在，则输出YES

代码：

#include <bits/stdc++.h>

using namespace std;

char Map[2005][2005];
int n,m;
int cnt[2005];

int main()
{
    scanf("%d%d",&n, &m);
    for (int i=0; i<n; i++){
        scanf("%s",Map[i]);
        for (int j=0; j<m; j++){
            if (Map[i][j] == '1'){
                cnt[j]++;
            }
        }
    }

    for (int i=0; i<n; i++){
        int flag = 1;
        for (int j=0; j<m; j++){
            if (Map[i][j] == '1' && cnt[j]==1){
                flag = 0;
            }
        }
        if (flag){
            printf("YES\n");
            return 0;
        }
    }
    printf("NO\n");
    return 0;
}