text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
int N, K;
bool A[100010][4];
unsigned int B[16];
int comp(int i) { return (1 << K) - (i + 1); }
int main() {
cin >> N >> K;
for (int i = 0; i < N; i++)
for (int j = 0; j < K; j++) cin >> A[i][j];
for (int i = 0; i < 1 << K; i++) B[i] = 0;
for (int i = 0; i < N; i++) {
int temp = 0;
for (int j = 0; j < K; j++) temp += A[i][j] * (1 << j);
B[temp]++;
}
if (B[0] > 0) {
cout << "YES\n";
return 0;
}
for (int i = 0; i < 1 << K; i++)
for (int j = i + 1; j < 1 << K; j++) {
if (B[i] > 0 && B[j] > 0) {
if ((i & j) == 0) {
cout << "YES\n";
return 0;
}
}
}
cout << "NO\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double eps = 0.000001;
const long double pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const long long MOD = 1e18 + 9;
const long long INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int minn = 1e5 + 9;
const int N = 5e3 + 123;
const int NN = 5e5 + 123;
const int PRI = 555557;
const int pri = 997;
int tests = 1;
int n, m, k, a[NN][5], cnt, ans[NN];
vector<int> v;
inline void Solve() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cnt = 0;
for (int j = 1; j <= k; j++) {
cin >> a[i][j];
cnt = cnt * 10 + a[i][j];
}
v.push_back(cnt);
}
sort(v.begin(), v.end());
v.resize(unique(v.begin(), v.end()) - v.begin());
if (!v[0]) {
cout << "YES";
exit(0);
}
for (int i = 0; i < v.size(); i++) {
for (int j = i + 1; j < v.size(); j++) {
int sum = v[i] + v[j];
bool ch = 1;
while (sum) {
if (sum % 10 > 1) ch = 0;
sum /= 10;
}
if (ch) {
cout << "YES";
exit(0);
}
}
}
cout << "NO";
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
while (tests--) {
Solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
const int MAXK = 5;
int A[MAXN];
int S[1 << MAXK];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1, iend = n; i <= iend; ++i) {
for (int j = 0, jend = k; j < jend; ++j) {
int x;
scanf("%d", &x);
A[i] ^= x << j;
}
}
for (int s = 0, send = 1 << k; s < send; ++s) {
for (int i = 1, iend = n; i <= iend; ++i) {
if ((A[i] & s) == 0) S[s] = 1;
}
}
bool chk = false;
for (int i = 1, iend = n; i <= iend; ++i) {
int s = A[i];
if (S[s]) chk = true;
}
if (chk)
puts("YES");
else
puts("NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXM = 100000;
const int INF = 0x3f3f3f3f;
template <class T>
void Read(T &x) {
x = 0;
char c = getchar();
bool flag = 0;
while (c < '0' || '9' < c) {
if (c == '-') flag = 1;
c = getchar();
}
while ('0' <= c && c <= '9') {
x = x * 10 + c - '0';
c = getchar();
}
if (flag) x = -x;
}
int n, k;
bool appear[20];
bool check() {
int ed = (1 << 4) - 1;
for (int s = 1; s <= ed; ++s) {
for (int ss = (s - 1) & s;; ss = (ss - 1) & s) {
appear[s] |= appear[ss];
if (!ss) break;
}
}
for (int s = 0; s <= ed; ++s)
if (appear[s] && appear[ed ^ s]) return true;
return false;
}
int main() {
Read(n), Read(k);
int t, sum;
for (int i = 1; i <= n; ++i) {
sum = 0;
for (int j = 0; j < k; ++j) scanf("%d", &t), sum = (sum << 1) + t;
for (int j = k; j < 4; ++j) sum <<= 1;
appear[sum] = true;
}
if (check())
puts("YES");
else
puts("NO");
}
|
#include <bits/stdc++.h>
using namespace std;
int was[(1 << 5)];
int main() {
int n, k;
cin >> n >> k;
was[0] = 1;
for (int i = 0; i < n; i++) {
vector<int> a(k, 0);
int m = 0;
for (int j = 0; j < k; j++) {
scanf("%d", &a[j]);
a[j] ^= 1;
m |= (a[j] << j);
}
bool ok = false;
for (int i = 0; i < (1 << k); i++) {
if (!was[i]) continue;
if ((i | m) == (1 << k) - 1) ok = true;
}
if (ok) {
printf("YES\n");
return 0;
}
was[m] = 1;
}
printf("NO\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<vector<int>> arr(n, vector<int>(k));
bool answer = false;
vector<int> check(1 << k);
int index = n + 1, temp;
for (int i = 0; i < n; ++i) {
temp = 0;
for (int j = 0; j < k; ++j) {
cin >> arr[i][j];
temp |= (arr[i][j] << j);
}
check[temp]++;
if (temp == 0) answer = true;
}
for (int i = 0; i < (1 << k); ++i) {
for (int j = 0; j < (1 << k); ++j) {
if (i & j) continue;
if (check[i] && check[j]) {
answer = true;
}
}
}
if (answer)
cout << "YES";
else
cout << "NO";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n, k, a[5] = {}, v[20] = {};
cin >> n >> k;
for (long long i = 0; i < n; i++) {
for (long long j = 0; j < k; j++) cin >> a[j];
v[a[0] + 2 * a[1] + 4 * a[2] + 8 * a[3]] = 1;
}
for (long long i = 0; i <= 1 << k; i++)
for (long long j = 0; j <= 1 << k; j++) {
if (v[i] && v[j] && !(i & j)) {
cout << "YES";
return 0;
}
}
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e18;
const long long MAX = 1e5 + 5;
vector<string> all_str;
long long n, k;
void substrings(string s = "") {
if (s.length() == k) {
all_str.push_back(s);
return;
}
string t1 = s + '0';
substrings(t1);
string t2 = s + '1';
substrings(t2);
}
bool possible(string cur, string str) {
for (long long i = 0; i < k; i++) {
if ((str[i] - '0') + (cur[i] - '0') > 1) return 0;
}
return 1;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> k;
long long pr[n][k];
bool zero_sum = false;
map<string, long long> cnt;
for (long long i = 0; i < n; i++) {
long long sum = 0;
string s;
for (long long j = 0; j < k; j++) {
cin >> pr[i][j];
sum += pr[i][j];
s += (pr[i][j] + '0');
}
if (sum == 0) zero_sum = true;
cnt[s]++;
}
if (zero_sum) {
cout << "YES\n";
return 0;
}
substrings();
for (long long i = 0; i < n; i++) {
string cur(k, '0');
for (long long j = 0; j < k; j++) {
if (pr[i][j]) cur[j] = '1';
}
for (auto str : all_str) {
if (possible(cur, str)) {
if (cnt[str]) {
cout << "YES";
return 0;
}
}
}
}
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, vis[20];
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; ++i) {
int tmp = 0;
for (int j = 1; j <= k; ++j) {
int x;
scanf("%d", &x);
tmp += x << (k - j);
}
vis[tmp] = 1;
}
int flag = 0;
for (int i = 0; i < (1 << k); ++i)
for (int j = 0, x; j < (1 << k); ++j)
if (vis[i] && vis[j] && !(i & j)) flag = 1;
puts(flag ? "YES" : "NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int vis[20];
int main() {
int n, k;
scanf("%d%d", &n, &k);
bool jud = false;
while (n--) {
int status = 0;
for (int i = 0; i < k; i++) {
int x;
scanf("%d", &x);
if (x) status |= 1 << i;
}
vis[status] = 1;
for (int i = 0; i < (1 << k); i++) {
if (status & i) continue;
if (vis[i]) jud = true;
}
}
if (jud)
puts("YES");
else
puts("NO");
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k, r, x = 0, f = 0;
cin >> n >> k;
r = 1 << k;
long long int arr[r];
long long int num[k];
for (long long int i = 0; i < r; i++) arr[i] = 0;
for (long long int i = 0; i < n; i++) {
x = 0;
for (long long int j = 0; j < k; j++) {
cin >> num[j];
if (num[j]) x += 1 << (k - j - 1);
}
arr[x] = 1;
}
for (long long int i = 0; i < r; i++) {
for (long long int j = 0; j < r; j++) {
if (!(i & j)) {
if (arr[i] && arr[j]) {
f = 1;
break;
}
}
}
}
if (f == 1)
cout << "YES";
else
cout << "NO";
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n, m;
cin >> n >> m;
set<int> st;
for (int i = 0; i < n; i++) {
int x = 0;
for (int j = 0; j < m; j++) {
int y;
cin >> y;
x = x * 2 + y;
}
st.insert(x);
}
for (int i = 0; i < (1 << m); i++) {
for (int j = 0; j < n; j++) {
if (!st.count(i)) continue;
for (auto it : st) {
if ((it & i) == 0) {
cout << "YES" << '\n';
return;
}
}
}
}
cout << "NO" << '\n';
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 50;
;
const int M = 255;
const int mod = 998244353;
const int mo = 123;
const double pi = acos(-1.0);
int n, m;
int ans = 0;
int vis[N];
vector<int> vec;
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) {
int res = 0;
for (int j = 0, x; j < m; j++) {
scanf("%d", &x);
if (x) res |= (1 << j);
}
if (!vis[res]) {
vec.push_back(res);
vis[res]++;
}
}
bool ok = false;
for (int i = 0; i < vec.size(); i++) {
for (int j = 0; j < vec.size(); j++) {
int x = vec[i] + vec[j];
int y = vec[i] ^ vec[j];
if (x == y) ok = true;
}
}
if (ok)
puts("YES");
else
puts("NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int n, k;
map<vector<bool>, long long int> mp;
bool x;
vector<vector<bool>> aise;
bool isit(vector<bool> a, vector<bool> b) {
for (long long int i = 0; i < k; i++) {
if (a[i] == 1 && b[i] == 1) {
return 0;
}
}
return 1;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
cin >> n >> k;
while (n--) {
vector<bool> is;
bool allzero = 1;
for (long long int i = 0; i < k; i++) {
cin >> x;
if (x) {
allzero = 0;
}
is.push_back(x);
}
if (allzero) {
cout << "YES\n";
return 0;
}
if (mp[is] == 0) {
aise.push_back(is);
}
mp[is] = 1;
}
long long int n = aise.size();
for (long long int i = 0; i < n; i++) {
for (long long int j = (i + 1); j < n; j++) {
if (isit(aise[i], aise[j])) {
cout << "YES\n";
return 0;
}
}
}
cout << "NO\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<string, bool> mop;
string cc = "";
bool ch(string s) {
if (mop[s]) return 1;
if (s == cc) return 0;
bool ret = 0;
for (int i = 0; i < s.size(); i++) {
string ns = s;
if (s[i] == '1') {
ns[i] = '0';
ret |= ch(ns);
}
}
return ret;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
;
int n, k;
cin >> n >> k;
for (int i = 0; i < k; i++) cc += '0';
while (n--) {
string a = "", b = "";
for (int i = 0; i < k; i++) {
char c;
cin >> c;
if (c == '1')
a += '1', b += '0';
else
a += '0', b += '1';
}
if (ch(b) || a == cc) return cout << "YES", 0;
mop[a] = 1;
}
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int cnt[100];
int main() {
int n, k;
cin >> n >> k;
int aa;
for (int i = 1; i <= n; i++) {
int tmp = 0;
for (int j = 0; j < k; j++) {
scanf("%d", &aa);
tmp = tmp << 1 | aa;
}
cnt[tmp]++;
}
if (cnt[0]) {
cout << "YES";
return 0;
}
int tot = (1 << k) - 1;
for (int i = 1; i <= tot; i++) {
if (cnt[i]) {
for (int j = 1; j <= tot; j++) {
if (cnt[j] && (i & j) == 0) {
cout << "YES";
return 0;
}
}
}
}
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int book[20];
int main() {
int n, k, i, j, a;
cin >> n >> k;
for (i = 0; i < n; i++) {
int now = 0;
for (j = 0; j < k; j++) {
scanf("%d", &a);
now += a * (1 << j);
}
book[now]++;
}
int flog = 0;
for (i = 0; i < 16; i++) {
for (j = i + 1; j < 16; j++) {
if ((i & j) == 0) {
if (book[i] && book[j]) flog = 1;
}
}
}
if (flog || book[0])
printf("YES\n");
else
printf("NO\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
set<int> si;
int n, k;
bool solve(set<int> &cands, vector<int> &chosen) {
if (cands.empty()) {
if (chosen.empty()) {
return false;
}
for (int i = 0; i < k; ++i) {
int cnt = 0;
for (const int num : chosen) {
cnt += (((num >> i) & 0x1) ? -1 : 1);
}
if (cnt < 0) {
return false;
}
}
return true;
}
int val = *cands.begin();
bool ok = false;
cands.erase(val);
ok |= solve(cands, chosen);
chosen.push_back(val);
ok |= solve(cands, chosen);
chosen.pop_back();
cands.insert(val);
return ok;
}
int main(int argc, char **argv) {
std::ios::sync_with_stdio(false);
cin >> n >> k;
for (int i = 0; i < n; ++i) {
int val = 0;
for (int j = 0; j < k; ++j) {
int t;
cin >> t;
val |= (t << j);
}
si.insert(val);
}
vector<int> chosen;
cout << (solve(si, chosen) ? "YES\n" : "NO\n");
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 7;
int vis[(1 << 4) + 3];
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
int cnt = 0;
for (int j = 1; j <= m; j++) {
int x;
cin >> x;
cnt += (1 << (j - 1)) * x;
}
vis[cnt] = 1;
}
int flag = 0;
for (int i = 0; i <= 16; i++) {
for (int j = 0; j <= 16; j++) {
if (vis[i] && vis[j]) {
int len = i & j;
if ((i & j) == 0) {
flag = 1;
break;
}
}
}
if (flag) break;
}
if (flag)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool c[22];
int main() {
int n, k;
scanf("%d %d", &n, &k);
for (int i = 0; i < n; ++i) {
int z = 0;
for (int j = 0; j < k; ++j) {
int x;
scanf("%d", &x);
z |= (x << j);
}
c[z] = 1;
}
for (int i = 0; i < 1 << k; ++i) {
for (int j = 0; j < 1 << k; ++j) {
if (c[i] && c[j] && !(i & j)) {
return !printf("YES");
}
}
}
puts("NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int VM = 16;
bitset<VM> c;
int p[VM];
int main() {
int n, e;
cin >> n >> e;
for (int i = 0; i < n; i++) {
int cod = 0;
for (int j = 0; j < e; j++) {
int x;
cin >> x;
if (x == 1) {
cod += (1 << j);
}
}
c[cod] = 1;
}
int np = 0;
for (int i = 0; i < VM; i++) {
if (c[i]) {
p[np++] = i;
}
}
bool exista = false;
int nr[e];
for (int i = 1; i < (1 << np); i++) {
int nrprob = 0;
for (int k = 0; k < e; k++) {
nr[k] = 0;
}
for (int j = 0; j < np; j++) {
if (i & (1 << j)) {
nrprob++;
for (int k = 0; k < e; k++) {
if (p[j] & (1 << k)) {
nr[k]++;
}
}
}
}
bool probleme_ok = true;
for (int k = 0; k < e; k++) {
if (nr[k] > nrprob / 2) {
probleme_ok = false;
}
}
if (probleme_ok) {
exista = true;
}
}
if (exista) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long double EPS = 1e-9;
const int N = 1e5 + 5;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
set<int> pr;
int n, k;
int main() {
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++) {
int nb = 0;
for (int j = 0; j < k; j++) {
int u;
scanf("%d", &u);
nb += u * (1 << j);
}
pr.insert(nb);
}
for (int u : pr) {
for (int v : pr)
if (!(u & v)) return printf("YES\n"), 0;
}
printf("NO\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int Set(int N, int pos) { return N = N | (1 << pos); }
int reset(int N, int pos) { return N = N & ~(1 << pos); }
bool check(int N, int pos) { return (bool)(N & (1 << pos)); }
map<int, bool> mip;
int a[5], taken[5], oka = 0;
int doit(int i, int k, int sum) {
if (i == k || mip[sum]) {
return mip[sum];
}
for (int ki = i; ki < k; ki++) {
if (a[ki] == 0) {
oka += doit(ki + 1, k, sum + (1 << ki)) || doit(ki + 1, k, sum);
} else
oka += doit(ki + 1, k, sum);
}
return oka;
}
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++) {
int temp = 0, rev = 0;
oka = 0;
for (int ki = 0, x, two = 1; ki < k; ki++) {
scanf("%d", &x);
temp += (x * two);
a[ki] = x;
x = x ? 0 : 1;
rev += x * two;
two *= 2;
taken[ki] = 0;
}
if (doit(0, k, 0) || temp == 0 || mip[rev]) {
cout << "YES";
return 0;
}
mip[temp] = true;
}
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline int gi() {
register int res = 0, s = 1;
register char ch;
for (ch = getchar(); (ch < '0' || ch > '9') && ch != '-'; ch = getchar())
;
if (ch == '-') s = -1, ch = getchar();
for (; ch >= '0' && ch <= '9'; ch = getchar()) res = 10 * res + ch - 48;
return res * s;
}
int n, k;
int s[100005][5];
int st[16];
int main() {
n = gi(), k = gi();
for (register int i = 1; i <= n; ++i) {
for (register int j = 1; j <= k; ++j) {
s[i][j] = gi();
}
register int r = 0;
for (register int j = 1; j <= k; ++j) r = r * 2 + s[i][j];
st[r]++;
}
for (register int i = 0; i < 15; ++i) {
for (register int j = 0; j < 15; ++j) {
if (st[i] && st[j] && ((i & j) == 0)) {
printf("YES\n");
return 0;
}
}
}
printf("NO\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int fuc[30], wo[5];
int main() {
int n, k;
while (~scanf("%d%d", &n, &k)) {
memset(fuc, 0, sizeof(fuc));
for (int i = 1; i <= n; i++) {
int x, sum = 0;
for (int j = k - 1; j >= 0; j--) {
scanf("%d", &x);
if (x) sum += (1 << j);
}
fuc[sum] = 1;
}
int f = 0;
if (fuc[0]) f = 1;
for (int i = 1; i < 16 && !f; i++)
for (int j = 1; j < 16 && !f; j++)
if (i != j && fuc[i] && fuc[j]) {
memset(wo, 0, sizeof(wo));
int x1 = i, x2 = j, kk = 0;
while (x1) {
wo[kk++] += x1 & 1;
x1 /= 2;
}
kk = 0;
while (x2) {
wo[kk++] += x2 & 1;
x2 /= 2;
}
if (wo[0] < 2 && wo[1] < 2 && wo[2] < 2 && wo[3] < 2) {
f = 1;
}
}
if (f)
printf("YES\n");
else
printf("NO\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 5;
bool vis[1 << 4];
int main() {
int n, k;
scanf("%d %d", &n, &k);
int el;
bool flg = 0;
if (n == 1) {
for (int i = 0; i < k; i++) {
scanf("%d", &el);
if (el & 1) {
puts("NO");
return 0;
}
}
puts("YES");
return 0;
}
for (int i = 0; i < n; i++) {
int no = 0;
int anotherNO = 0;
for (int j = 0; j < k; j++) {
scanf("%d", &el);
no += (el & 1) << j;
anotherNO += (!(el & 1)) << j;
}
for (int j = 0; j < 1 << 4; j++) {
if (!(j & no)) {
if (vis[j]) {
flg = 1;
}
}
}
vis[no] = 1;
}
if (flg) {
puts("YES");
} else {
puts("NO");
}
}
|
#include <bits/stdc++.h>
int a[17];
int main() {
int n, k;
scanf("%d%d", &n, &k);
while (n--) {
int tot = 0, x;
for (int i = 0; i < k; ++i) scanf("%d", &x), tot |= (x << i);
++a[tot];
}
for (int i = 0; i < 16; ++i)
for (int j = i; j < 16; ++j)
if ((i & j) == 0 && a[i] && a[j]) return 0 * printf("YES\n");
printf("NO\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, vis[20];
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; ++i) {
int tmp = 0;
for (int j = 1; j <= k; ++j) {
int x;
scanf("%d", &x);
tmp += x << (k - j);
}
vis[tmp] = 1;
}
int flag = 0;
for (int i = 0; i < (1 << k); ++i)
for (int j = 0, x; j < (1 << k); ++j)
if (vis[i] && vis[j]) {
for (x = 0; x < k; ++x)
if (((i >> x) & 1) && ((j >> x) & 1)) break;
if (x == k) flag = 1;
}
puts(flag ? "YES" : "NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long double eps = 1e-12;
const double PI = 3.14159265359;
const int INF = 1e9 + 41;
const long long unsigned LINF = 1e18 + 41;
const int N = 1000 * 100;
long long unsigned myRand() {
long long unsigned q = rand();
return (q << 16) ^ rand();
}
int myabs(int x) { return (x < 0 ? -x : x); }
void init() { cout.precision(2); }
void win() {
cout << "YES";
exit(0);
}
int a[100100];
void solve() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
int q = 0;
for (int j = 0; j < k; j++) {
int x;
cin >> x;
q = q * 2 + x;
}
a[q]++;
}
if (a[0]) win();
for (int i = 1; i < (1 << k); i++)
for (int j = 1; j < (1 << k); j++) {
bool ok = true;
for (int q = 0; q < k; q++)
if ((i & (1 << q)) != 0 && (j & (1 << q)) != 0) ok = false;
if (ok && a[i] && a[j]) win();
}
cout << "NO";
}
int main() {
init();
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double pi = 3.141592653589793238463;
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int n, k;
cin >> n >> k;
set<int> s;
for (int i = 0; i < (n); i++) {
int x = 0;
for (int i = 0; i < (k); i++) {
int bit;
cin >> bit;
x <<= 1;
x += bit;
}
s.insert(x);
}
for (int x : s) {
for (int y = 0; y < 16; y++)
if ((x & y) == 0 && (s.find(y) != s.end()))
return cout << "YES" << '\n', 0;
}
cout << "NO" << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 300000;
const int INF = 0x3f3f3f3f;
bool occur[20];
int main(int argc, char const *argv[]) {
long long n, k;
while (cin >> n >> k) {
memset(occur, 0, sizeof occur);
while (n--) {
long long te, sum = 0, digit = 1;
for (long long i = 1; i <= k; i++) {
scanf("%lld", &te), sum += te * digit;
digit *= 2;
}
occur[sum] = 1;
}
long long lim = 1;
for (long long i = 1; i <= k; ++i) lim *= 2;
bool find = 0;
if (occur[0] == 1) find = 1;
for (int i = 0; i < lim; ++i) {
if (occur[i])
for (int j = i + 1; j < lim; ++j)
if (occur[j] && (i & j) == 0) find = 1;
}
if (find)
printf("YES\n");
else
printf("NO\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int dp[16];
int a[100001];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
for (int j = 0; j < k; j++) {
int t;
cin >> t;
a[i] |= (t << j);
}
dp[a[i]] = i + 1;
}
if (dp[0]) {
cout << "YES\n";
} else {
bool ok = 0;
int u = (1 << k);
for (int i = 1; i < u; i++) {
for (int j = i + 1; j < u; j++) {
if ((i & j) == 0 && dp[i] && dp[j]) {
ok = 1;
}
}
}
cout << (ok ? "YES\n" : "NO\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
vector<string> vec_splitter(string s) {
s += ',';
vector<string> res;
while (!s.empty()) {
res.push_back(s.substr(0, s.find(',')));
s = s.substr(s.find(',') + 1);
}
return res;
}
void debug_out(vector<string> __attribute__((unused)) args,
__attribute__((unused)) int idx,
__attribute__((unused)) int LINE_NUM) {
cerr << endl;
}
template <typename Head, typename... Tail>
void debug_out(vector<string> args, int idx, int LINE_NUM, Head H, Tail... T) {
if (idx > 0)
cerr << ", ";
else
cerr << "Line(" << LINE_NUM << ") ";
stringstream ss;
ss << H;
cerr << args[idx] << " = " << ss.str();
debug_out(args, idx + 1, LINE_NUM, T...);
}
inline long long int read() {
long long int x = 0;
static long long int p;
p = 1;
static char c;
c = getchar();
while (!isdigit(c)) {
if (c == '-') p = -1;
c = getchar();
}
while (isdigit(c)) {
x = (x << 1) + (x << 3) + (c - 48);
c = getchar();
}
x *= p;
return x;
}
void check(int aa, int b) {
for (long long int i = 0; i < (long long int)5; i++) {
if (((aa) & (1 << (i))) && ((b) & (1 << (i)))) return;
}
cout << "YES" << endl;
exit(0);
}
void solve(int tt);
int main() {
int tt = 1;
for (long long int i = 0; i < (long long int)tt; i++) solve(i + 1);
}
void solve(int tt) {
vector<long long int> phase1[5];
long long int n = read();
long long int teams = read();
vector<int> ase(20);
int pk = 0;
for (long long int i = 0; i < (long long int)n; i++) {
pk = 0;
for (long long int k = 0; k < (long long int)teams; k++) {
long long int a = read();
;
if (a) pk = pk | int(1 << (k));
;
}
ase[pk]++;
}
if (n == 1) {
if (pk == 0) {
cout << "YES" << endl;
exit(0);
}
}
for (long long int i = 0; i < (long long int)16; i++) {
if (!ase[i]) continue;
for (long long int j = 0; j < (long long int)16; j++) {
if (!ase[j])
continue;
else if (i == j && ase[j] < 2)
continue;
check(i, j);
}
}
cout << "NO" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int ans = 0;
void fun1(vector<vector<int>> a, int i, int n, int q, int u) {
if (i < n) {
fun1(a, i + 1, n, q, u);
u += a[i][0];
q++;
if (q / 2 >= u) ans++;
fun1(a, i + 1, n, q, u);
}
}
void fun2(vector<vector<int>> a, int i, int n, int q, int u, int v) {
if (i < n) {
fun2(a, i + 1, n, q, u, v);
u += a[i][0];
v += a[i][1];
q++;
if (q / 2 >= max(u, v)) ans++;
fun2(a, i + 1, n, q, u, v);
}
}
void fun3(vector<vector<int>> a, int i, int n, int q, int u, int v, int w) {
if (i < n) {
fun3(a, i + 1, n, q, u, v, w);
u += a[i][0];
v += a[i][1];
w += a[i][2];
q++;
if (q / 2 >= max(u, max(v, w))) ans++;
fun3(a, i + 1, n, q, u, v, w);
}
}
void fun4(vector<vector<int>> a, int i, int n, int q, int u, int v, int w,
int x) {
if (i < n) {
fun4(a, i + 1, n, q, u, v, w, x);
u += a[i][0];
v += a[i][1];
w += a[i][2];
x += a[i][3];
q++;
if (q / 2 >= max(u, max(v, max(w, x)))) ans++;
fun4(a, i + 1, n, q, u, v, w, x);
}
}
int main() {
int n, k, i, x, y, f[10000] = {};
vector<vector<int>> v;
cin >> n >> k;
while (n--) {
y = 0;
vector<int> v2;
for (i = 0; i < k; i++) {
cin >> x;
y = (y * 10) + x;
v2.push_back(x);
}
if (f[y] == 0) v.push_back(v2);
f[y]++;
}
if (k == 1)
fun1(v, 0, v.size(), 0, 0);
else if (k == 2)
fun2(v, 0, v.size(), 0, 0, 0);
else if (k == 3)
fun3(v, 0, v.size(), 0, 0, 0, 0);
else
fun4(v, 0, v.size(), 0, 0, 0, 0, 0);
if (ans)
cout << "YES";
else
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline int read() {
char c;
int s = 0, t = 1;
while (!isdigit(c = getchar()))
if (c == '-') t = -1;
do {
s = s * 10 + c - '0';
} while (isdigit(c = getchar()));
return s * t;
}
inline long long readl() {
char c;
long long s = 0;
int t = 1;
while (!isdigit(c = getchar()))
if (c == '-') t = -1;
do {
s = s * 10 + c - '0';
} while (isdigit(c = getchar()));
return s * t;
}
int f[100100];
int main() {
int n, m;
n = read(), m = read();
for (int i = 1; i <= n; i++) {
int sum = 0;
for (int j = 1; j <= m; j++) {
int c;
c = read();
if (c) sum += 1 << j - 1;
}
f[sum] = true;
}
for (int i = 0; i <= 1 << m; i++)
for (int j = 0; j <= 1 << m; j++)
if (!(i & j) && f[i] && f[j]) {
printf("Yes\n");
return 0;
}
printf("No\n");
}
|
#include <bits/stdc++.h>
using namespace std;
int arr[100005][5];
int sums[100005];
unordered_set<int> values;
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
for (int j = 0; j < k; j++) {
scanf("%d", &arr[i][j]);
}
}
for (int i = 0; i < n; i++) {
int s = 0;
for (int j = 0; j < k; j++) {
s += arr[i][j] * pow(2, j);
}
values.insert(s);
sums[i] = s;
}
for (int i = 0; i < n; i++) {
vector<int> poss;
if (sums[i] == 0) {
cout << "YES" << endl;
return 0;
}
int alias = sums[i];
for (int i = 0; i < 16; i++) {
if ((alias & i) == 0) poss.push_back(i);
}
for (int a : poss) {
if (values.find(a) != values.end()) {
cout << "YES" << endl;
return 0;
}
}
}
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, x[4];
int t[20];
bool check(int x, int y) {
x >>= 4 - m;
y >>= 4 - m;
while (x > 0 || y > 0) {
if ((x & 1) && (y & 1)) return 0;
x >>= 1;
y >>= 1;
}
return 1;
}
int main() {
int i, j, v;
scanf("%d%d", &n, &m);
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) scanf("%d", &x[j]);
v = x[0] * 8 + x[1] * 4 + x[2] * 2 + x[3];
t[v]++;
}
if (t[0]) {
printf("YES");
return 0;
}
for (i = 0; i < 16; i++)
for (j = 0; j < 16; j++)
if (((i != j) && t[i] && t[j] && check(i, j)) ||
((i == j) && t[i] >= 2 && check(i, j))) {
printf("YES");
return 0;
}
printf("NO");
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
cout << name << " : " << arg1 << "\n";
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
void bolt() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
long long cnt[16];
int32_t main() {
bolt();
long long n, k;
cin >> n >> k;
for (long long i = 0; i < n; i++) {
long long num = 0;
for (long long j = 0; j < k; j++) {
long long x;
cin >> x;
num = (num << 1) | x;
}
cnt[num]++;
}
if (cnt[0] > 0) {
cout << "YES";
return 0;
}
for (long long i = 0; i < (1 << k); i++) {
for (long long j = 0; j < (1 << k); j++) {
if (cnt[i] != 0 and cnt[j] != 0 and ((i & j) == 0)) {
cout << "YES";
return 0;
}
}
}
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 2034567891;
const long long int INF64 = 4234567890123456789ll;
long long int gcd(long long int a, long long int b) {
return (b == 0 ? a : gcd(b, a % b));
}
long long int lcm(long long int a, long long int b) {
return (a * (b / gcd(a, b)));
}
vector<vector<long long int> > v;
set<long long int> s;
long long int k;
bool solve() {
long long int t = v.size();
for (long long int i = 0; i < t; i++) {
long long int sum = 0;
for (long long int j = 0; j < k; j++) {
sum += v[i][j];
}
if (!sum) return true;
}
for (long long int i = 0; i < t; i++) {
for (long long int j = i + 1; j <= t - 1; j++) {
long long int sum = 0, f = 0;
for (long long int l = 0; l < k; l++) {
sum = v[i][l] + v[j][l];
if (sum > 1) f = 1;
}
if (!f) return true;
}
}
for (long long int i = 0; i < t; i++) {
for (long long int j = i + 1; j <= t - 1; j++) {
for (long long int m = j + 1; m <= t - 1; m++) {
long long int sum = 0, f = 0;
for (long long int l = 0; l < k; l++) {
sum = v[i][l] + v[j][l] + v[m][l];
if (sum > 1) f = 1;
}
if (!f) return true;
}
}
}
for (long long int i = 0; i < t; i++) {
for (long long int j = i + 1; j <= t - 1; j++) {
for (long long int m = j + 1; m <= t - 1; m++) {
for (long long int p = m + 1; p <= t - 1; p++) {
long long int sum = 0, f = 0;
for (long long int l = 0; l < k; l++) {
sum = v[i][l] + v[j][l] + v[m][l] + v[p][l];
if (sum > 2) f = 1;
}
if (!f) return true;
}
}
}
}
return false;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long int n, x;
cin >> n >> k;
for (long long int i = 0; i < n; i++) {
vector<long long int> tm;
for (long long int j = 0; j < k; j++) {
cin >> x;
tm.push_back(x);
}
long long int no = 0, l = 0;
for (long long int p = tm.size() - 1; p >= 0; p--) {
if (tm[p] == 1) no += pow(2, l);
l++;
}
if (s.find(no) == s.end()) {
s.insert(no);
v.push_back(tm);
}
}
if (solve())
cout << "YES";
else
cout << "NO";
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
int n, k;
int a[20];
long long read() {
long long s = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
s = s * 10 + ch - '0';
ch = getchar();
}
return s * f;
}
int main() {
memset(a, 0, sizeof(a));
n = read(), k = read();
for (int i = 1; i <= n; ++i) {
int res = 0;
for (int j = 1; j <= k; ++j) {
int p = read();
res += (p << (k - j));
}
++a[res];
}
int flag = 0;
for (int i = 0; i < (1 << k); ++i) {
for (int j = 0; j < (1 << k); ++j) {
if (a[i] > 0 && a[j] > 0 && ((i & j) == 0)) {
flag = 1;
printf("YES\n");
break;
}
}
if (flag) break;
}
if (!flag) {
printf("NO\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void chkmin(T& x, T y) {
if (y < x) x = y;
}
template <class T>
inline void chkmax(T& x, T y) {
if (x < y) x = y;
}
bool vis[16];
int main() {
int n, k, i, j, l, b, a;
scanf("%d%d", &n, &k);
for (i = 1; i <= n; i++) {
b = 0;
for (j = 1; j <= k; j++) {
scanf("%d", &a);
b = 2 * b + a;
}
vis[b] = 1;
}
for (i = 0; i < 16; i++)
for (j = 0; j < 16; j++) {
if (vis[i] && vis[j]) {
for (l = 0; l < 4; l++)
if ((i & j) / (1 << l) & 1) break;
if (l == 4) {
puts("YES");
return 0;
}
}
}
puts("NO");
}
|
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.);
const double eps = 1e-15;
const int MOD = 1e9 + 7;
long long power(long long x, long long y) {
if (y == 0) return 1;
long long s = power(x, y / 2);
s *= s;
if (y & 1) s *= x;
return s;
}
long long Ceil(long long x, long long y) { return (x + y - 1) / y; }
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int n, k;
int a[100005][4];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
set<int> s;
for (int i = 0; i < n; i++)
for (int j = 0; j < k; j++) cin >> a[i][j];
for (int i = 0; i < n; i++) {
int num = 0;
for (int j = k - 1; j >= 0; j--)
if (a[i][j] == 1) num += power(2, k - j - 1);
s.insert(num);
}
bool res = 0;
for (int i : s) {
for (int j : s)
if ((i & j) == 0) res = 1;
}
cout << (res ? "YES" : "NO");
}
|
#include <bits/stdc++.h>
using namespace std;
const int Tmax = 100005;
int n, k, s[Tmax];
bool v[Tmax];
int main() {
int i, j, tmp, sum;
scanf("%d%d", &n, &k);
for (i = 1; i <= n; i++) {
sum = 0;
for (j = 0; j < k; j++) {
scanf("%d", &tmp);
sum += tmp << j;
}
s[i] = sum;
v[sum] = true;
}
for (i = 1; i <= n; i++) {
for (j = 0; j <= 31; j++)
if ((s[i] & j) == 0 && v[j] == true) {
printf("YES");
return 0;
}
}
printf("NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int vis[100];
int flag = 0;
vector<int> mp;
void dfs(int pos, int s) {
if (pos == mp.size()) return;
if (vis[s]) flag = 1;
dfs(pos + 1, s);
int s1 = s | (1 << mp[pos]);
if (vis[s1]) flag = 1;
dfs(pos + 1, s1);
}
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
int tmp = 0;
for (int j = 0; j < k; j++) {
int v;
cin >> v;
tmp <<= 1;
tmp += v;
}
vis[tmp] = 1;
}
for (int i = 0; i < (1 << k); i++) {
if (vis[i]) {
mp.clear();
for (int j = 0; j < k; j++) {
if (((i >> j) & 1) == 0) mp.push_back(j);
}
dfs(0, 0);
}
}
if (flag)
printf("YES\n");
else
printf("NO\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = int(1e5) + 5;
const int inf = (int)1e9 + 7;
int n, k;
int a[N][5];
vector<vector<int> > all;
int main() {
scanf("%d %d", &n, &k);
for (int i = 1; i <= n; ++i) {
int cnt = 0;
vector<int> my;
for (int j = 0; j < k; ++j) {
scanf("%d", a[i] + j);
cnt += a[i][j];
if (a[i][j]) {
my.push_back(j);
}
}
all.push_back(my);
}
sort(all.begin(), all.end());
all.resize(unique(all.begin(), all.end()) - all.begin());
int sz = (int)all.size();
for (int i = 1; i < (1 << sz); ++i) {
vector<int> cnt(5, 0);
int tot = 0;
for (int j = 0; j < sz; ++j) {
if ((i >> j) & 1) {
for (int f : all[j]) {
cnt[f]++;
}
++tot;
}
}
int bad = 0;
for (int j = 0; j < k; ++j) {
if (cnt[j] > tot / 2) {
bad = 1;
}
}
if (!bad) {
printf("YES\n");
return 0;
}
}
printf("NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
long long int dx[] = {0, 1, 0, -1, -1, 1, -1, 1};
long long int dy[] = {-1, 0, 1, 0, -1, 1, 1, -1};
const long long int MAXN = 2e6 + 5;
const long long int N = 1e5 + 5;
long long int n, m;
long long int binpow(long long int n, long long int p) {
long long int res = 1;
while (p > 0) {
if (p & 1) res = res * n;
n = n * n;
p >>= 1;
}
return res;
}
long long int power(long long int n, long long int p) {
long long int res = 1;
n %= 1000000007;
while (p > 0) {
if (p & 1) res = (res * n) % 1000000007;
n = (n * n) % 1000000007;
p >>= 1;
}
return res;
}
long long int modInverse(long long int n, long long int p) {
return power(n, p - 2);
}
long long int fact[MAXN], inv[MAXN], invfact[MAXN];
void initFactorials() {
fact[0] = 1;
for (long long int i = 1; i < MAXN; i++) {
fact[i] = (fact[i - 1] * i * 1LL) % 1000000007;
}
inv[1] = 1;
for (long long int i = 2; i < MAXN; i++)
inv[i] = inv[1000000007 % i] * (1000000007 - 1000000007 / i) % 1000000007;
invfact[0] = 1;
for (long long int i = 1; i < MAXN; i++)
invfact[i] = (invfact[i - 1] * inv[i]) % 1000000007;
}
long long int nCrMod(long long int n, long long int r) {
if (n < r) return 0;
if (r == 0) return 1;
long long int num = fact[n], den = (fact[r] * fact[n - r]) % 1000000007;
long long int inv = modInverse(den, 1000000007);
return (num * inv) % 1000000007;
}
void solve() {
long long int x, y, z, k;
cin >> n >> k;
vector<vector<long long int>> a(n, vector<long long int>(k));
for (long long int i = 0; i < n; i++) {
for (long long int j = 0; j < k; j++) {
cin >> a[i][j];
}
}
for (long long int j = 0; j < k; j++) {
long long int cnt = 0;
for (long long int i = 0; i < n; i++) {
if (a[i][j]) cnt++;
}
if (cnt == n) {
cout << "NO\n";
return;
}
}
for (long long int i = 0; i < n; i++) {
long long int flag = 1;
for (long long int j = 0; j < k; j++)
if (a[i][j]) flag = 0;
if (flag) {
cout << "YES\n";
return;
}
}
sort(a.begin(), a.end());
a.erase(unique(a.begin(), a.end()), a.end());
;
n = a.size();
for (long long int i1 = 0; i1 < n; i1++) {
for (long long int i2 = i1 + 1; i2 < n; i2++) {
long long int mask1 = 0, mask2 = 0;
for (long long int j = 0; j < k; j++) {
if (a[i1][j]) mask1 |= (1 << j);
if (a[i2][j]) mask2 |= (1 << j);
}
if ((mask1 & mask2) == 0) {
cout << "YES\n";
return;
}
}
}
cout << "NO\n";
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long int t = 1;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k;
int g[100002][10];
int a[100003];
map<int, int> ma;
bool judge(int x, int x1) {
if (x == x1)
return true;
else
return false;
}
set<int> se;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
for (int j = 0; j < k; j++) scanf("%d", &g[i][j]);
for (int j = 0; j < k; j++) {
a[i] += (g[i][j] << j);
}
se.insert(a[i]);
}
int x = 0;
for (int i = 0; i < k; i++) {
x += (1 << i);
}
set<int>::iterator it;
for (int i = 0; i <= x; i++) {
for (int j = 0; j <= x; j++) {
if (se.count(i) && se.count(j) && (i & j) == 0) {
cout << "yes" << endl;
return 0;
}
}
}
cout << "no\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k;
int bm[(1 << 5)];
int arr[5];
int cek(int n, int a, int b, int c, int d) {
for (int i = 0; i < 4; i++) {
arr[i] = 0;
if (a & (1 << i)) arr[i]++;
if (b & (1 << i)) arr[i]++;
if (c & (1 << i)) arr[i]++;
if (d & (1 << i)) arr[i]++;
}
for (int i = 0; i < 4; i++) {
if (arr[i] <= n / 2) continue;
return false;
}
return true;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
for (int i = 0; i < n; i++) {
int mask = 0;
for (int j = 0; j < k; j++) {
int bit;
cin >> bit;
if (bit) mask |= (1 << j);
}
bm[mask]++;
}
for (int i = 0; i < (1 << k); i++) {
for (int i2 = 0; i2 < (1 << k); i2++) {
for (int i3 = 0; i3 < (1 << k); i3++) {
map<int, int> cnt;
cnt[i]++;
cnt[i2]++;
cnt[i3]++;
bool can = true;
for (auto it : cnt) {
if (bm[it.first] < it.second) {
can = false;
}
}
if (can && cek(3, i, i2, i3, 0)) {
cout << "YES" << endl;
return 0;
}
}
}
}
for (int i = 0; i < (1 << k); i++) {
for (int i2 = 0; i2 < (1 << k); i2++) {
map<int, int> cnt;
cnt[i]++;
cnt[i2]++;
bool can = true;
for (auto it : cnt) {
if (bm[it.first] < it.second) {
can = false;
}
}
if (can && cek(2, i, i2, 0, 0)) {
cout << "YES" << endl;
return 0;
}
}
}
for (int i = 0; i < (1 << k); i++) {
for (int i2 = 0; i2 < (1 << k); i2++) {
for (int i3 = 0; i3 < (1 << k); i3++) {
for (int i4 = 0; i4 < (1 << k); i4++) {
map<int, int> cnt;
cnt[i]++;
cnt[i2]++;
cnt[i3]++;
cnt[i4]++;
bool can = true;
for (auto it : cnt) {
if (bm[it.first] < it.second) {
can = false;
}
}
if (can && cek(4, i, i2, i3, i4)) {
cout << "YES" << endl;
return 0;
}
}
}
}
}
if (bm[0] > 0) {
cout << "YES" << endl;
return 0;
}
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int cnt[17];
int main() {
int n, k;
cin >> n >> k;
int aa;
for (int i = 0; i < n; i++) {
int tmp = 0;
for (int j = k - 1; j >= 0; j--) {
scanf("%d", &aa);
tmp += (aa << j);
}
cnt[tmp]++;
}
if (cnt[0]) {
cout << "YES";
return 0;
}
int tot = (1 << k) - 1;
for (int i = 1; i <= tot; i++) {
if (cnt[i]) {
for (int j = i + 1; j <= tot; j++) {
if (cnt[j] && (i & j) == 0) {
cout << "YES";
return 0;
}
}
}
}
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(1 << k, 0);
for (int i = 0; i < n; i++) {
int sum = 0;
for (int j = 0; j < k; j++) {
int b;
cin >> b;
sum += (b * (1 << j));
}
a[sum] += 1;
}
int flag = 0;
for (int i = 0; i < (1 << k); i++) {
if (a[0] != 0) {
flag = 1;
break;
}
if (a[i] == 0) continue;
int j;
for (j = i + 1; j < 1 << k; j++) {
if ((j & i) == 0 && a[j] != 0) {
flag = 1;
break;
}
}
if (j != 1 << k) break;
}
if (flag)
cout << "yes" << endl;
else
cout << "no" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const double eps = 1e-6;
bool G[100005][4];
bool tmp[20];
bool solve(int n, int k) {
for (int i = 0; i < n; i++) {
bool flag = true;
int q = 0;
for (int j = 0; j < k; j++) {
if (G[i][j]) flag = false;
q = q << 1 | G[i][j];
}
tmp[q] = true;
if (flag) return true;
}
for (int i = 0; i < 16; i++)
for (int j = i + 1; j < 16; j++)
if (tmp[i] && tmp[j] && (i & j) == 0) return true;
return false;
}
int main() {
int n, k;
while (cin >> n >> k) {
memset(G, 0, sizeof(G));
memset(tmp, 0, sizeof(tmp));
for (int i = 0; i < n; i++)
for (int j = 0; j < k; j++) cin >> G[i][j];
puts(solve(n, k) ? "YES" : "NO");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 9;
int n, k, t[30];
int main() {
scanf("%d %d", &n, &k);
for (int i = 0; i < n; ++i) {
int num = 0, bit;
for (int j = 0; j < k; ++j) {
num *= 2;
cin >> bit;
num += bit;
}
t[num]++;
}
if (t[0]) {
puts("YES");
return 0;
}
bool ok = 0;
for (int i = 0; i < (1 << k); ++i) {
for (int j = 0; j < (1 << k); ++j) {
if (i == j || !t[i] || !t[j] || (i ^ j) != (i + j)) continue;
ok = 1;
}
if (ok) {
puts("YES");
return 0;
}
}
puts("NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long inf = 9.2e18;
const int maxn = 107;
const int INF = 2.1e9;
const int MOD = 1e9 + 7;
const double dif = 1e-7;
const double PI = acos(-1.0);
int n, m, k;
int vis[maxn];
int main() {
while (cin >> n >> k) {
memset(vis, 0, sizeof(vis));
for (int i = 0; i < n; i++) {
int x = 0;
for (int j = 0; j < k; j++) {
int d;
cin >> d;
if (d == 1) x |= (1 << j);
}
vis[x]++;
}
int flag = 0;
for (int i = 0; i < (1 << k); i++) {
for (int j = 0; j < (1 << k); j++) {
if (vis[i] && vis[j] && ((i & j) == 0)) {
flag = 1;
break;
}
}
}
if (flag)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int cnt[1 << 7];
int main() {
int n, k;
scanf("%d %d", &n, &k);
memset(cnt, 0, sizeof cnt);
for (int i = 0; i < n; ++i) {
int tt = 0, x;
for (int j = k - 1; j >= 0; --j) {
scanf("%d", &x);
tt |= (x << j);
}
cnt[tt]++;
}
for (int i = 0; i < 16; ++i) {
for (int j = 0; j < 16; ++j) {
if ((i & j) == 0 && cnt[i] > 0 && cnt[j] > 0) {
puts("YES");
return 0;
}
}
}
puts("NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
int n, k;
int cnt[(1 << 4) + 5];
int now[4];
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
int st = 0;
for (int j = 0; j < k; j++) {
int x;
scanf("%d", &x);
st <<= 1;
st += x;
}
cnt[st]++;
}
int m = 1 << k;
int tot = 1 << m;
bool ok = false;
for (int s = 0; s < tot; s++) {
int C = 0;
memset(now, 0, sizeof now);
for (int st = 0; st < m; st++)
if (s & (1 << st)) {
C += (cnt[st] ? 1 : 0);
for (int i = 0; i < k; i++)
if ((st & (1 << i))) now[i] += (cnt[st] ? 1 : 0);
}
bool tmp = true;
for (int i = 0; i < k; i++) {
if (now[i] * 2 > C) tmp = false;
}
if (tmp && C) ok = true;
}
puts(ok ? "YES" : "NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool vis[16];
int main() {
int n, k, temp, temp1;
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++) {
temp1 = 0;
for (int j = 0; j < k; j++) {
scanf("%d", &temp);
temp1 = (temp1 << 1) + temp;
}
vis[temp1] = true;
}
for (int i = 0; i < 16; i++) {
for (int j = i; j < 16; j++) {
if (vis[i] && vis[j] && ((i & j) == 0)) {
puts("YES");
return 0;
}
}
}
puts("NO");
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
const double eps = 1e-4;
const int mod = 1e9 + 7;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const int inf = 0x3f3f3f3f;
const int maxn = 1e3 + 7;
const int maxm = 1e6 + 7;
const double pi = acos(-1.0);
int n, k;
bool vis[maxn];
int main() {
memset(vis, false, sizeof vis);
scanf("%d%d", &n, &k);
bool flag = false;
for (int i = 1; i <= n; i++) {
int state = 0;
for (int j = 0; j < k; j++) {
int tmp;
scanf("%d", &tmp);
if (tmp) state |= (1 << j);
}
vis[state] = true;
for (int i = 0; i < (1 << k); i++) {
if (state & i) continue;
if (vis[i]) flag = true;
}
}
if (flag)
puts("YES");
else
puts("NO");
}
|
#include <bits/stdc++.h>
using namespace std;
int inline read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
int n, k, ton[20], x, a[100010];
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
int p = 0;
for (int j = 0; j < k; j++) {
x = read();
(p <<= 1) += x;
}
a[i] = p;
for (int j = 0; j <= 19; j++)
if ((j & p) == 0) ton[j]++;
}
for (int i = 1; i <= n; i++)
if (ton[a[i]] > 0) {
printf("YES");
return 0;
}
printf("NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct mystruct {
long long v;
mystruct *next;
};
int structcmp(const void *v1, const void *v2) {
return ((mystruct *)v1)->v - ((mystruct *)v2)->v;
}
int intcmp(const void *v1, const void *v2) { return *(int *)v1 - *(int *)v2; }
long long minn(long long v1, long long v2) { return v1 < v2 ? v1 : v2; }
long long maxx(long long v1, long long v2) { return v1 > v2 ? v1 : v2; }
long long kp[100010][10];
long long cnt[10] = {0};
int n, k;
bool p1() {
int i;
for (i = 0; i < n; i++) {
if (kp[i][0] == (0)) return true;
}
return false;
}
bool p2() {
int i;
long long v0cnt = 0;
long long v1cnt = 0;
for (i = 0; i < n; i++) {
if (kp[i][0] == (0) && kp[i][1] == (0))
return true;
else if (kp[i][0] == (0))
v0cnt++;
else if (kp[i][1] == (0))
v1cnt++;
}
if (v0cnt != 0 && v1cnt != 0) return true;
return false;
}
long long fv(long long v) { return v == (0) ? 0 : 1; }
bool p3() {
int i;
long long vc[10] = {0};
for (i = 0; i < n; i++) {
long long detectv =
(fv(kp[i][2]) << 8) + (fv(kp[i][1]) << 4) + (fv(kp[i][0]) << 0);
if (detectv == 0) return true;
if (detectv == 0x001) vc[1]++;
if (detectv == 0x010) vc[2]++;
if (detectv == 0x100) vc[3]++;
if (detectv == 0x110) vc[4]++;
if (detectv == 0x101) vc[5]++;
if (detectv == 0x011) vc[6]++;
}
if (vc[1] * vc[2] != 0 || vc[2] * vc[3] != 0 || vc[3] * vc[1] != 0)
return true;
if (vc[1] * vc[4] != 0 || vc[2] * vc[5] != 0 || vc[3] * vc[6] != 0)
return true;
return false;
}
bool p4() {
int i;
long long vc[20] = {0};
for (i = 0; i < n; i++) {
int detectv = (fv(kp[i][3]) << 12) + (fv(kp[i][2]) << 8) +
(fv(kp[i][1]) << 4) + (fv(kp[i][0]) << 0);
if (detectv == 0) return true;
if (detectv == 0x0001) vc[1]++;
if (detectv == 0x0010) vc[2]++;
if (detectv == 0x0100) vc[3]++;
if (detectv == 0x1000) vc[4]++;
if (detectv == 0x1110) vc[5]++;
if (detectv == 0x1101) vc[6]++;
if (detectv == 0x1011) vc[7]++;
if (detectv == 0x0111) vc[8]++;
if (detectv == 0x1100) vc[9]++;
if (detectv == 0x1010) vc[10]++;
if (detectv == 0x0110) vc[11]++;
if (detectv == 0x1001) vc[12]++;
if (detectv == 0x0101) vc[13]++;
if (detectv == 0x0011) vc[14]++;
}
long long ok1 = 0;
for (i = 1; i <= 4; i++) {
ok1 += (vc[i] != 0);
}
if (ok1 > 1) return true;
if (vc[9] * vc[14] != 0 || vc[10] * vc[13] != 0 || vc[11] * vc[12] != 0)
return true;
if (vc[1] != 0) {
if (vc[5] != 0 || vc[9] != 0 || vc[10] != 0 || vc[11] != 0) return true;
} else if (vc[2] != 0) {
if (vc[6] != 0 || vc[9] != 0 || vc[12] != 0 || vc[13] != 0) return true;
} else if (vc[3] != 0) {
if (vc[7] != 0 || vc[10] != 0 || vc[12] != 0 || vc[14] != 0) return true;
} else if (vc[4] != 0) {
if (vc[8] != 0 || vc[11] != 0 || vc[13] != 0 || vc[14] != 0) return true;
}
return false;
}
int main() {
cin >> n >> k;
int i, j;
for (i = 0; i < n; i++) {
for (j = 0; j < k; j++) {
scanf("%lld", &kp[i][j]);
}
}
bool ans;
if (k == 1) {
ans = p1();
} else if (k == 2) {
ans = p2();
} else if (k == 3) {
ans = p3();
} else {
ans = p4();
}
if (ans) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[20];
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k, flag = 0;
cin >> n >> k;
for (int i = 0; i < n; i++) {
int t, tsum = 0;
int ss = 0;
for (int j = 0; j < k; j++) {
cin >> t;
ss += t << (k - j - 1);
tsum += t;
}
if (!tsum) flag++;
a[ss]++;
}
for (int i = 0; i < 16; i++) {
if (!a[i]) continue;
for (int j = 0; j < 16; j++) {
if (!a[j]) continue;
if (!(i & j)) {
cout << "YES" << endl;
return 0;
}
}
}
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int dp[16];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
int s = 0;
for (int i = 0; i < k; i++) {
int x;
cin >> x;
s = s * 2 + x;
}
dp[s]++;
}
for (int i = 0; i < 16; i++) {
for (int j = 0; j < 16; j++) {
if (dp[i] > 0 && dp[j] > 0 && (i & j) == 0) {
cout << "YES";
return 0;
}
}
}
cout << "NO";
}
|
#include <bits/stdc++.h>
using namespace std;
class fast_iostream {
protected:
static size_t constexpr buffer_size = 4096;
char buffer[buffer_size];
bool external_file;
FILE *file;
size_t position;
public:
fast_iostream(const string &file_name, const string default_file_name,
FILE *default_file, const char *mode)
: external_file(file_name != default_file_name), position(0) {
if (external_file)
file = fopen(file_name.c_str(), mode);
else
file = default_file;
}
~fast_iostream() {
if (external_file) fclose(file);
}
};
class fast_istream : public fast_iostream {
size_t size = 0;
public:
inline bool is_eof() {
if (position == size) {
position = 0, size = fread(buffer, 1, buffer_size, file);
return size == 0;
}
return false;
}
inline int next_char() { return is_eof() ? -1 : buffer[position++]; }
inline bool seek_eof() {
int c = next_char();
while (c == ' ' || c == '\n') c = next_char();
if (c == -1) return true;
assert(position != 0);
position--;
return false;
}
inline char read_char() {
int c = next_char();
while (c == ' ' || c == '\n') c = next_char();
assert(c != -1);
return (char)c;
}
inline void copy_word(char *s) {
int c = read_char();
while (c != ' ' && c != '\n' && c != -1) *(s++) = (char)c, c = next_char();
}
inline string read_string() {
int c = read_char();
string s;
while (c != ' ' && c != '\n' && c != -1) s += (char)c, c = next_char();
return s;
}
template <typename T = int>
void read_int(T &n) {
int c = read_char();
T m;
bool negative = false;
n = 0;
if (c == '-')
negative = true;
else if (c != '+')
n = c - '0';
for (c = next_char(); c != ' ' && c != '\n' && c != -1; c = next_char())
m = (n <<= 1), n <<= 2, n += m, n += c, n -= '0';
if (negative) n = -n;
}
fast_istream(const string &file_name = "stdin")
: fast_iostream(file_name, "stdin", stdin, "r") {}
} fin;
template <typename T = int>
void read_int(T &x) {
fin.read_int(x);
}
class fast_ostream : public fast_iostream {
bool line_flush;
static bool local;
public:
inline void flush() { fwrite(buffer, position, 1, file), position = 0; }
inline void put_char(char c) {
if (position == buffer_size) flush();
buffer[position++] = c;
}
inline void put_c_str(const char *s) {
while (*s != 0) put_char(*(s++));
}
inline void write_string(const string &s, const char *after = " ") {
put_c_str(s.c_str()), put_c_str(after);
}
template <typename T>
inline void write_int(T x, const char *after) {
char s[100];
int n = 0;
if (x == 0)
put_char('0');
else {
if (x < 0) put_char('-'), x = -x;
while (x > 0) s[n++] = (x % 10) + '0', x /= 10;
reverse(s, s + n), s[n] = 0;
put_c_str(s);
}
put_c_str(after);
}
inline void write_endl() {
put_char('\n');
if (line_flush && local) flush();
}
fast_ostream(const string &file_name = "stdout", bool lflush = true)
: fast_iostream(file_name, "stdout", stdout, "w"), line_flush(lflush) {
memset(buffer, 0, buffer_size);
}
~fast_ostream() { flush(); }
} fout;
template <typename T>
void write_int(const T x, const char *after = " ") {
fout.write_int(x, after);
}
bool fast_ostream::local = true;
bitset<16> problem;
int k;
bool solvable(const int c1, const int c2, const int c3, const int c4,
const int i, const int m, const int p) {
int j = i + 1;
if (!problem[i]) return j < p ? solvable(c1, c2, c3, c4, j, m, p) : false;
int count[] = {c1, c2, c3, c4}, max_known = 0;
for (int l = 0, q = 1; l < k; l++, q <<= 1) {
if (i & q) count[l]++;
if (count[l] > max_known) max_known = count[l];
}
int l = m + 1;
if ((max_known << 1) <= l) return true;
if (j < p && solvable(count[0], count[1], count[2], count[3], j, l, p))
return true;
return solvable(c1, c2, c3, c4, j, m, p);
}
int main() {
int bit, i, j, n, p, x;
cin >> n >> k, p = 1 << k;
for (i = 0; i < n; i++, problem[x] = 1)
for (x = j = 0; j < k; j++, x <<= 1, x |= bit) cin >> bit;
if (solvable(0, 0, 0, 0, 0, 0, p))
cout << "YES";
else
cout << "NO";
}
|
#include <bits/stdc++.h>
using namespace std;
int a[20];
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k, flag = 0, ss;
cin >> n >> k;
for (int i = 0; i < n; i++) {
int t, tsum = 0;
ss = 0;
for (int j = 1; j <= k; j++) {
cin >> t;
ss += t << (k - j);
tsum += t;
}
if (!tsum) flag++;
a[ss]++;
}
if (flag) {
cout << "YES" << endl;
return 0;
}
for (int i = 0; i < 15; i++) {
if (!a[i]) continue;
for (int j = i; j < 16; j++) {
if (!a[j]) continue;
if (!(i & j)) {
cout << "YES" << endl;
return 0;
}
}
}
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000;
int n, k, a[maxn + 9][5];
int vis[20020115];
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= k; ++j) scanf("%d", &a[i][j]);
if (n == 1) {
for (int j = 1; j <= k; ++j)
if (a[1][j] == 1) {
cout << "NO" << endl;
return 0;
}
cout << "YES" << endl;
return 0;
}
for (int i = 1; i <= n; ++i) {
int res = 0;
for (int j = 1; j <= k; ++j)
if (a[i][j]) res |= (1 << (j - 1));
++vis[res];
}
for (int i = 0; i < (1 << k); ++i)
for (int j = 0; j < (1 << k); ++j)
if ((i & j) == 0 && vis[i] != 0 && vis[j] != 0) {
cout << "YES" << endl;
return 0;
}
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool ansnull(int a, int b, int c, int d) {
int ans = 0;
if (a != 0) ++ans;
if (b != 0) ++ans;
if (c != 0) ++ans;
if (d != 0) ++ans;
if (ans >= 2)
return true;
else
return false;
}
int main() {
int a[100010][5];
int n, k;
cin >> n >> k;
for (int i = 0; i <= n; ++i)
for (int j = 1; j <= 4; ++j) a[i][j] = 0;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= k; ++j) cin >> a[i][j];
vector<int> v(20, 0);
for (int i = 1; i <= n; ++i) {
int sum = 0;
for (int j = 1; j <= 4; ++j) {
sum += a[i][j] * (1 << (4 - j));
}
v[sum]++;
}
if (v[0] != 0) {
cout << "YES";
return 0;
}
if (ansnull(v[1], v[2], v[4], v[8])) {
cout << "YES";
return 0;
}
int ind = -1;
for (int i = 0; i <= 3; ++i)
if (v[(1 << i)] != 0) ind = (1 << i);
if (ansnull(v[12], v[3], 0, 0)) {
cout << "YES";
return 0;
}
if (ansnull(v[6], v[9], 0, 0)) {
cout << "YES";
return 0;
}
if (ansnull(v[5], v[10], 0, 0)) {
cout << "YES";
return 0;
}
if (ind != -1) {
if (v[15 - ind] != 0) {
cout << "YES";
return 0;
}
if (ind == 1) {
if (v[12] != 0 || v[6] != 0 || v[10] != 0) {
cout << "YES";
return 0;
}
}
if (ind == 2) {
if (v[12] != 0 || v[9] != 0 || v[5] != 0) {
cout << "YES";
return 0;
}
}
if (ind == 4) {
if (v[9] != 0 || v[3] != 0 || v[10] != 0) {
cout << "YES";
return 0;
}
}
if (ind == 8) {
if (v[6] != 0 || v[3] != 0 || v[5] != 0) {
cout << "YES";
return 0;
}
}
}
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long n, k;
cin >> n >> k;
vector<vector<long long> > a(n, vector<long long>(k));
for (long long i = 0; i < (n); ++i) {
for (long long j = 0; j < (k); ++j) {
cin >> a[i][j];
}
}
map<long long, long long> cnt;
for (long long i = 0; i < n; ++i) {
long long mask = 0;
for (long long j = 0; j < k; ++j) {
if (a[i][j] == 1) {
mask |= (1 << j);
}
}
cnt[mask]++;
}
if (cnt[0] > 0) {
cout << "YES";
return 0;
}
vector<long long> tmp;
for (auto x : cnt) {
if (x.second > 0) {
tmp.push_back(x.first);
}
}
for (long long i = 0; i < tmp.size(); ++i) {
for (long long j = 0; j < tmp.size(); ++j) {
bool ok = true;
long long mask1 = tmp[i];
long long mask2 = tmp[j];
for (long long bit = 0; bit < k; ++bit) {
if (((1 << bit) & mask1) && ((1 << bit) & mask2)) {
ok = false;
}
}
if (ok) {
cout << "YES";
return 0;
}
}
}
cout << "NO";
}
|
#include <bits/stdc++.h>
using namespace std;
clock_t T;
constexpr auto EPS = 1e-7;
const int mod = (int)1e9 + 7;
const double pi = acos(-1);
int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
long long gcd(long long a, long long b) { return (a) ? gcd(b % a, a) : b; }
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
void COME_BACK() {
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
}
int ar[100006][4];
int main() {
COME_BACK();
int n, k;
cin >> n >> k;
set<string> st;
vector<string> v(n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < k; j++) {
char c;
cin >> c;
v[i].push_back(c);
}
st.insert(v[i]);
}
for (auto it : st) {
string s = it;
int can = 0;
for (int i = 0; i < n; i++) {
for (int idx = 0; idx < k; idx++) {
can |= (v[i][idx] == '1' && s[idx] == '1');
}
if (!can) return cout << "YES", 0;
can = 0;
}
}
cout << "NO"
<< "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << "\n";
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
const long long limit = 1e5 + 1;
const long long inf = 1e7;
const long long mod = 1e9 + 7;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n;
cin >> n;
long long k;
cin >> k;
set<string> st;
for (long long i = 0; i < n; i++) {
long long t = k;
string x;
while (t--) {
char a;
cin >> a;
x += a;
}
st.insert(x);
}
bool flag = false;
for (auto it = st.begin(); it != st.end(); it++) {
queue<string> q;
string t;
q.push(t);
string x = *it;
for (long long i = 0; i < k; i++) {
long long t = q.size();
while (t--) {
string y = q.front();
q.pop();
if (x[i] == '1') {
string t1 = y + '0';
q.push(t1);
} else {
string t1 = y + '0';
string t2 = y + '1';
q.push(t1);
q.push(t2);
}
}
}
flag = false;
while (!q.empty()) {
string t = q.front();
q.pop();
if (st.find(t) != st.end()) {
flag = true;
break;
}
}
if (flag) {
break;
}
}
if (flag) {
cout << "YES"
<< "\n";
} else {
cout << "NO"
<< "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, d, t, f[100010], vis[1000];
set<int> b[10];
bool flag;
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
flag = true;
t = 0;
for (int j = 1; j <= k; j++) {
scanf("%d", &d);
t = (t << 1) + d;
if (d)
flag = false;
else
b[j].insert(i);
}
if (flag == true) {
printf("YES\n");
return 0;
}
f[i] = t;
vis[t] = 1;
}
for (int i = 1; i <= (k << 1); i++) {
for (int j = 1; j <= n; j++) {
if (vis[f[j]] && vis[i] && (f[j] & i) == 0) {
printf("YES\n");
return 0;
}
}
}
printf("NO\n");
return 0;
}
|
#include <bits/stdc++.h>
int f[50], n, k, c, x;
bool ok;
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
c = 0;
for (int j = 1; j <= k; j++) {
scanf("%d", &x);
c <<= 1;
c |= x;
}
f[c]++;
}
for (int i = 0; i <= 1 << k; i++)
for (int j = 0; j <= i; j++)
if ((i & j) == 0 && f[i] && f[j]) ok = true;
if (ok)
printf("YES\n");
else
printf("NO\n");
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int N = 0;
int n, m;
int cnt[16];
int main() {
scanf("%d%d", &n, &m);
memset(cnt, 0, sizeof(cnt));
while (n--) {
int mask = 0;
for (int x, i = 0; i < m; i++) {
scanf("%d", &x);
mask += x << i;
}
cnt[mask]++;
}
for (int i = 0; i < 16; i++)
for (int j = 0; j < 16; j++)
if (cnt[i] && cnt[j] && (i & j) == 0) {
puts("YES");
return 0;
}
puts("NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int cnt[25];
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
int mask = 0;
for (int j = 0; j < k; j++) {
int t;
scanf("%d", &t);
mask = mask << 1 | t;
}
cnt[mask]++;
}
if (cnt[0]) return 0 * printf("YES\n");
for (int i = 0; i < (1 << k); i++)
for (int j = 0; j < (1 << k); j++)
if (!(i & j) && cnt[i] && cnt[j]) return 0 * printf("YES\n");
return 0 * printf("NO\n");
}
|
#include <bits/stdc++.h>
using namespace std;
struct p {
int two;
int numx;
} xx[6000];
int ww[5];
int n, k;
int read() {
int x = 0;
char ch;
ch = getchar();
while (ch < '0' || ch > '9') {
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = (x << 1) + (x << 3) - ch + '0';
ch = getchar();
}
return x;
}
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
for (int w = 1; w <= k; w++) cin >> ww[w];
int v = ww[1] + ww[2] * 2 + ww[3] * 4 + ww[4] * 8;
xx[v].numx++;
}
if (xx[0].numx != 0) {
cout << "YES" << endl;
return 0;
}
for (int i = 0; i <= 15; i++) {
if (xx[i].numx == 0) continue;
for (int w = i + 1; w <= 15; w++) {
if (xx[w].numx == 0) continue;
if ((i ^ w) == (i + w)) {
cout << "YES" << endl;
return 0;
}
}
}
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
int bitS[16];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
int stat = 0;
for (int j = 0; j < m; j++) {
int shit;
scanf("%d", &shit);
if (!shit) stat += (1 << j);
}
for (int j = 0; j < (1 << m); j++) {
if ((j & stat) == j) bitS[j] = 1;
}
}
bitS[0] = 1;
bool succ = false;
for (int i = 0; i < (1 << m); i++) {
int op = (1 << m) - 1 - i;
if (bitS[i] && bitS[op]) {
succ = true;
}
}
printf("%s\n", succ ? "YES" : "NO");
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int INF = (long long int)(8e18);
const long long int MOD = 1e9 + 7;
map<string, int> mp;
vector<string> v;
int main() {
ios ::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
string s = "";
for (int j = 0; j < k; j++) {
char c;
cin >> c;
s += c;
}
v.push_back(s);
mp[s]++;
}
for (int i = 0; i < n; i++) {
string a = v[i];
string b = "";
string c;
for (int j = 0; j < k; j++) {
b += '0';
}
c = b;
for (int j = 0; j < (1 << k); j++) {
for (int p = 0; p < k; p++) {
if (((1 << p) & j) && a[p] == '0') {
b[p] = '1';
}
}
if (mp[b] > 0) {
cout << "YES" << '\n';
return 0;
}
b = c;
}
}
cout << "NO" << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-8;
const double PI = acos(-1.0);
const int INF = 1e9 + 10;
const int MOD = 1e9 + 7;
const int N = 1e6 + 10;
int vis[30], v[5];
int main() {
int n, k;
while (~scanf("%d%d", &n, &k)) {
memset(vis, 0, sizeof(vis));
for (int i = 1; i <= n; i++) {
int x, sum = 0;
for (int j = k - 1; j >= 0; j--) {
scanf("%d", &x);
if (x) sum += (1 << j);
}
vis[sum] = 1;
}
int flag = 0;
if (vis[0]) flag = 1;
for (int i = 1; i < 16 && !flag; i++)
for (int j = 1; j < 16 && !flag; j++)
if (i != j && vis[i] && vis[j]) {
memset(v, 0, sizeof(v));
int x1 = i, x2 = j, kk = 0;
while (x1) {
v[kk++] += x1 & 1;
x1 /= 2;
}
kk = 0;
while (x2) {
v[kk++] += x2 & 1;
x2 /= 2;
}
if (v[0] < 2 && v[1] < 2 && v[2] < 2 && v[3] < 2) {
flag = 1;
}
}
if (flag)
puts("YES");
else
puts("NO");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int vis[500], c[5], n, k;
vector<int> Q;
int Count(int x, int cc = 0) {
while (x) cc++, x -= x & (-x);
return cc;
}
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; ++i) {
int s = 0, v;
for (int j = 0; j < k; ++j) {
scanf("%d", &v);
if (v) s |= (1 << j);
}
vis[s] = 1;
}
int st = (1 << k);
for (int i = 0; i < st; ++i)
if (vis[i]) Q.push_back(i);
int n = Q.size();
for (int i = 0; i < (1 << n); ++i)
if (i != 0) {
memset(c, 0, sizeof c);
for (int j = 0; j < n; ++j)
if (i & (1 << j)) {
int s = Q[j];
for (int g = 0; g < k; ++g)
if (s & (1 << g)) c[g]++;
}
int flag = 1;
for (int j = 0; j < k; ++j)
if (c[j] > Count(i) / 2) flag = 0;
if (flag) return 0 * printf("YES\n");
}
puts("NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0) return a;
gcd(b, a % b);
}
void sieve() {
int i, j;
int b[1000009];
for (i = 2; i < 1000009; i++) {
if (b[i] == 0) {
for (j = 2 * i; j < 1000009; j = j + i) b[j] = 1;
}
}
}
int bs(pair<int, int> p[], int n, int key, int i) {
int low = i, high = n - 1;
int ans = -1;
while (low <= high) {
int mid = low + high;
mid = mid / 2;
if (p[mid].first > key)
high = mid - 1;
else {
low = mid + 1;
ans = mid;
}
}
return ans;
}
int gcdExtended(int a, int b, int *x, int *y);
int modInverse(int a, int m) {
int x, y;
int g = gcdExtended(a, m, &x, &y);
if (g != 1)
cout << "Inverse doesn't exist";
else {
int res = (x % m + m) % m;
return res;
}
}
int gcdExtended(int a, int b, int *x, int *y) {
if (a == 0) {
*x = 0, *y = 1;
return b;
}
int x1, y1;
int gcd = gcdExtended(b % a, a, &x1, &y1);
*x = y1 - (b / a) * x1;
*y = x1;
return gcd;
}
struct piyush {
int tm;
int fa;
int fb;
};
bool operator<(piyush a, piyush b) { return a.tm > b.tm; }
bool cmp(piyush a, piyush b) { return a.tm < b.tm; }
signed main() {
int n, i, j, k, t;
cin >> n >> k;
int bits[16];
memset(bits, 0, sizeof(bits));
int a[n][k];
int numb = 0;
for (i = 0; i < n; i++) {
for (j = 0; j < k; j++) {
cin >> a[i][j];
numb += (1 << j);
}
}
for (i = 0; i < n; i++) {
int num = 0;
for (j = 0; j < k; j++) {
if (a[i][j] > 0) {
num += 1 << j;
}
}
bits[num]++;
}
int z = 0;
for (i = 0; i < 16; i++) {
for (j = i + 1; j < 16; j++) {
if (bits[i] > 0 && bits[j] > 0) {
k = i & j;
if (k == 0) z = 1;
}
}
}
if (z == 1 || bits[0] > 1 || (n == 1 && bits[0] == 1))
printf("YES\n");
else
printf("NO\n");
}
|
#include <bits/stdc++.h>
using namespace std;
void qmax(int &x, int y) {
if (x < y) x = y;
}
void qmin(int &x, int y) {
if (x > y) x = y;
}
inline long long read() {
char s;
long long k = 0, base = 1;
while ((s = getchar()) != '-' && s != EOF && !(isdigit(s)))
;
if (s == EOF) exit(0);
if (s == '-') base = -1, s = getchar();
while (isdigit(s)) {
k = k * 10 + (s ^ '0');
s = getchar();
}
return k * base;
}
inline void write(int x) {
static char cnt, num[15];
cnt = 0;
if (!x) {
printf("0");
return;
}
for (; x; x /= 10) num[++cnt] = x % 10;
for (; cnt; putchar(num[cnt--] + 48))
;
}
int n, k, vis[20], ans;
int a[20], cnt;
void check() {
if (!cnt) return;
int b[4] = {0};
for (int i = 0, x, t = 0; i < 16; i++)
if (vis[i]) {
t = 0;
x = i;
while (x) {
if (x & 1) b[t]++;
x /= 2;
++t;
}
}
if (b[0] * 2 > cnt) return;
if (b[1] * 2 > cnt) return;
if (b[2] * 2 > cnt) return;
if (b[3] * 2 > cnt) return;
ans = 1;
}
void dfs(int x) {
if (x == 16) {
check();
return;
}
if (a[x]) {
cnt++;
vis[x] = 1;
dfs(x + 1);
vis[x] = 0;
cnt--;
}
dfs(x + 1);
}
int main() {
n = read(), k = read();
for (int i = 1, cur, x; i <= n; i++) {
cur = 0;
for (int j = 1; j <= k; j++) {
x = read();
cur = cur << 1 | x;
}
a[cur]++;
}
dfs(0);
if (ans == 1) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n, k;
cin >> n >> k;
bool arr[16];
int a;
memset(arr, 0, sizeof arr);
while (n--) {
int p = 0;
for (int i = 0; i < k; i++) {
cin >> a;
p = 2 * p + a;
}
arr[p] = true;
}
bool pos = false;
for (int i = 0; i < 16; i++) {
for (int j = i + 1; j < 16; j++) {
if (arr[i] && arr[j] && !(i & j)) {
pos = true;
}
}
}
if (pos || arr[0])
cout << "YES\n";
else
cout << "NO\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LNF = 0x3f3f3f3f3f3f3f3f;
const int MOD = 1000000007;
const double EPS = 1e-8;
const long double EUL = 2.71828182845904523536;
const long double PII = 3.14159265358979323846;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k;
while (cin >> n >> k) {
int upto = 1 << k;
vector<int> a(upto);
while (n--) {
int x = 0;
for (int i = 0; i < k; i++) {
int temp;
cin >> temp;
x |= (temp << i);
}
a[x] = 1;
}
bool oui = false;
for (int i = 0; i < upto; i++) {
for (int j = i; j < upto; j++)
if (a[i] && a[j] && !(i & j)) {
oui = true;
break;
}
}
cout << (oui ? "YES" : "NO") << endl;
}
cerr << "Time : " << 1000 * (long double)clock() / (long double)CLOCKS_PER_SEC
<< "ms\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100010;
const int MAXK = 4;
int _w;
int n, k, know[4], a[1 << MAXK];
int popcnt(int x) {
int cnt = 0;
while (x) {
cnt += (x & 1);
x >>= 1;
}
return cnt;
}
int main() {
_w = scanf("%d%d", &n, &k);
for (int i = 0; i < n; ++i) {
int x = 0;
for (int j = 0; j < k; ++j) {
int y;
_w = scanf("%d", &y);
know[j] += y;
x = (x << 1) | y;
}
a[x] = 1;
}
for (int i = 0; i < k; ++i)
if (know[i] == n) return puts("NO"), 0;
if (a[0]) return puts("YES"), 0;
if (k == 1 || k == 2) {
return puts("YES"), 0;
} else if (k == 3) {
for (int i = 0; i < (1 << k); ++i)
if (a[i] && popcnt(i) == 1) return puts("YES"), 0;
} else {
for (int i = 0; i < (1 << k); ++i)
if (a[i]) {
if (popcnt(i) == 1) return puts("YES"), 0;
if (popcnt(i) == 2 && a[(~i) & 15]) return puts("YES"), 0;
}
}
return puts("NO"), 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k;
int cnt[111];
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
int x = 0;
for (int j = 0; j < k; j++) {
int t;
scanf("%d", &t);
x = x * 2 + t;
}
cnt[x]++;
}
bool ans = false;
if (cnt[0]) ans = true;
int m = 1 << k;
for (int S = 1; S < (1 << m); S++) {
int tmp[4], all = 0;
memset(tmp, 0, sizeof tmp);
for (int i = 0; i < m; i++)
if ((S >> i & 1) && cnt[i]) {
all++;
for (int j = 0; j < k; j++)
if (i >> j & 1) tmp[j]++;
}
if (*max_element(tmp, tmp + k) * 2 <= all && all) {
ans = true;
}
}
puts(ans ? "YES" : "NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k;
int a[21];
int main() {
int i, j;
scanf("%d%d", &n, &k);
for (i = 1; i <= n; ++i) {
int sta = 0;
for (j = 1; j <= k; ++j) {
int x;
scanf("%d", &x);
sta += x << j - 1;
}
a[sta]++;
}
int sum = (1 << k) - 1;
for (i = 0; i <= sum; ++i)
for (j = 0; j <= sum; ++j)
if ((i & j) == 0 && a[i] && a[j]) {
printf("YES");
return 0;
}
printf("NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
vector<vector<long long int> > v;
v.assign(n, vector<long long int>(k));
unordered_set<long long int> s;
for (long long int i = 0; i < n; ++i) {
for (long long int j = 0; j < k; ++j) {
cin >> v[i][j];
}
long long int val = 0;
for (long long int j = 0; j < k; ++j) {
val += (1 << (k - 1 - j)) * v[i][j];
}
s.insert(val);
}
vector<long long int> vv[(1 << (k))];
for (long long int i = 0; i < (1 << (k)); ++i) {
for (long long int j = 0; j < (1 << (k)); ++j) {
if ((i & j) == 0) {
vv[i].push_back(j);
}
}
}
for (auto it : s) {
for (long long int i = 0; i < vv[it].size(); ++i) {
if (s.find(vv[it][i]) != s.end()) {
cout << "YES" << endl;
return 0;
}
}
}
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
int tt[maxn];
int cnt[100];
int main() {
int n, k;
cin >> n >> k;
int aa;
for (int i = 0; i < n; i++) {
int tmp = 0;
for (int j = k - 1; j >= 0; j--) {
scanf("%d", &aa);
tmp += (aa << j);
}
cnt[tmp]++;
}
if (cnt[0]) {
cout << "YES";
return 0;
}
int tot = (1 << k) - 1;
for (int i = 1; i <= tot; i++) {
if (cnt[i]) {
for (int j = 1; j <= tot; j++) {
if (cnt[j] && (i & j) == 0) {
cout << "YES";
return 0;
}
}
}
}
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[200];
int main() {
int n, k, i, j, t, t1;
cin >> n >> k;
memset(a, 0, sizeof(a));
for (i = 0; i < n; i++) {
t = 0;
for (j = 0; j < k; j++) {
cin >> t1;
t += (t1 << j);
}
a[t] = 1;
}
if (a[0] == 1) {
cout << "YES";
return 0;
}
for (i = 1; i < 1 << k; i++)
for (j = 1; j < 1 << k; j++)
if (a[i] == 1 && a[j] == 1 && ((i & j) == 0)) {
cout << "YES";
return 0;
}
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, x, tmp, p[30];
int main(void) {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
tmp = 0;
for (int j = 0; j < k; j++) {
scanf("%d", &x);
tmp |= (x << j);
}
p[tmp]++;
}
for (int i = 0; i < 16; i++)
for (int j = 0; j < 16; j++) {
if ((i & j) == 0 && p[i] && p[j]) {
printf("YES\n");
return 0;
}
}
printf("NO\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int KGCD(int a, int b) {
if (a == 0) return b;
if (b == 0) return a;
if (~a & 1) {
if (b & 1)
return KGCD(a >> 1, b);
else
return KGCD(a >> 1, b >> 1) << 1;
}
if (~b & 1) return KGCD(a, b >> 1);
if (a > b) return KGCD((a - b) >> 1, b);
return KGCD((b - a) >> 1, a);
}
int LCM(int a, int b) { return a / KGCD(a, b) * b; }
int mm[20];
int main() {
int n, m, x;
while (scanf("%d%d", &n, &m) != EOF) {
memset(mm, 0, sizeof(mm));
for (int i = 1; i <= n; i++) {
int t = 0;
for (int j = 1; j <= m; j++) {
scanf("%d", &x);
t = t * 2 + x;
}
mm[t] = 1;
}
int tt = pow(2, m);
int flag = 0;
for (int i = 0; i < tt; i++) {
for (int j = 0; j < tt; j++) {
if (mm[i] && mm[j] && (i & j) == 0) {
printf("YES\n");
flag = 1;
break;
}
}
if (flag) break;
}
if (!flag) printf("NO\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int Set(int mask, int pos) { return mask = mask | (1 << pos); }
bool check(int mask, int pos) { return (bool)(mask & (1 << pos)); }
int vis[16], posSum[5];
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n, k, a;
cin >> n >> k;
for (int i = 0; i < n; i++) {
int sum = 0, p = k - 1;
for (int j = 0; j < k; j++) {
cin >> a;
sum += (a * (1 << p));
p--;
}
vis[sum] = 1;
}
if (vis[0]) {
cout << "YES" << endl;
return 0;
}
for (int i = 0; i < (1 << k); i++) {
for (int j = 0; j < (1 << k); j++) {
if (vis[i] && vis[j]) {
bool flag = true;
memset(posSum, 0, sizeof(posSum));
for (int x = 0; x < k; x++) {
if (check(i, x)) posSum[x]++;
if (check(j, x)) posSum[x]++;
if (posSum[x] >= 2) {
flag = false;
break;
}
}
if (flag) {
cout << "YES" << endl;
return 0;
}
}
}
}
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using lli = long long int;
const lli INFTY = 1000 * 1000 * 1000;
using pii = tuple<lli, lli>;
using piii = tuple<lli, lli, lli>;
using vi = vector<lli>;
using vii = vector<pii>;
using viii = vector<piii>;
using vvi = vector<vi>;
using vvii = vector<vii>;
using vviii = vector<viii>;
using vb = vector<bool>;
using vvb = vector<vb>;
int nbTiles, nbTeams;
int tilesOf[2][2][2][2];
const int PREM_WIN = 1, PREM_LOSE = 2, PREM_NOTHING = 0;
const int NB_PERMS = 6;
const int PERMS[6][4] = {{0, 1, 2, 3}, {0, 1, 3, 2}, {0, 2, 1, 3},
{0, 2, 3, 1}, {0, 3, 1, 2}, {0, 3, 2, 1}};
int& tileWith(vector<bool> acc) {
assert(acc.size() >= 4);
return tilesOf[acc[0]][acc[1]][acc[2]][acc[3]];
}
int inp() {
vector<bool> winIf(nbTeams, false);
vector<bool> has(nbTeams, false);
for (lli _ = 0; _ < (lli)(nbTiles); ++_) {
vector<bool> line(4, false);
int nbMissing = nbTeams;
for (lli i = 0; i < (lli)(nbTeams); ++i) {
int v;
scanf("%d", &v);
line[i] = v == 0;
if (line[i]) {
nbMissing--;
has[i] = true;
}
}
if (nbMissing == 0) return PREM_WIN;
if (nbMissing == 1) {
for (lli i = 0; i < (lli)(nbTeams); ++i) {
if (!line[i]) {
winIf[i] = true;
break;
}
}
}
tileWith(line)++;
}
for (lli team = 0; team < (lli)(nbTeams); ++team) {
if (winIf[team] && has[team])
return PREM_WIN;
else if (!has[team])
return PREM_LOSE;
}
if (nbTeams < 4) return PREM_LOSE;
return PREM_NOTHING;
}
bool has(int id, const int* perm) {
vector<bool> acc(4, false);
acc[perm[id]] = true;
acc[perm[(id + 1) % 4]] = true;
return tileWith(acc) > 0;
}
bool cycleWith(const int* perm) {
return has(0, perm) && has(1, perm) && has(2, perm) && has(4, perm);
}
bool check4() {
for (lli permId = 0; permId < (lli)(NB_PERMS); ++permId) {
const int* perm = PERMS[permId];
if (cycleWith(perm) || (has(0, perm) && has(2, perm))) {
return true;
}
}
return false;
}
int main() {
scanf("%d%d", &nbTiles, &nbTeams);
int premVal = inp();
switch (premVal) {
case PREM_WIN:
puts("YES");
return 0;
case PREM_LOSE:
puts("NO");
return 0;
default:
break;
}
assert(nbTeams == 4);
puts(check4() ? "YES" : "NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(16), b(5);
while (n--) {
for (int i = 1; i <= k; i++) scanf("%d", &b[i]);
a[b[1] + b[2] * 2 + b[3] * 4 + b[4] * 8] = 1;
}
for (int i = 0; i < (1 << k); i++) {
for (int j = 0; j < (1 << k); j++) {
if (!(i & j) && a[i] && a[j]) return cout << "YES", 0;
}
}
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int cnt[50];
int main() {
int n, k;
cin >> n >> k;
int aa;
for (int i = 0; i < n; i++) {
int tmp = 0;
for (int j = k - 1; j >= 0; j--) {
scanf("%d", &aa);
tmp += (aa << j);
}
cnt[tmp]++;
}
if (cnt[0]) {
cout << "YES";
return 0;
}
int tot = (1 << k) - 1;
for (int i = 1; i <= tot; i++) {
if (cnt[i]) {
for (int j = 1; j <= tot; j++) {
if (cnt[j] && (i & j) == 0) {
cout << "YES";
return 0;
}
}
}
}
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
const int INF = 0x3f3f3f3f;
using namespace std;
ostream &operator<<(ostream &os, const vector<int> &v) {
for (auto i : v) os << ' ' << i;
return os;
}
ostream &operator<<(ostream &os, const pair<int, int> &p) {
return os << " (" << p.first << "," << p.second << ")";
}
int main() {
int n, k;
scanf(" %d %d", &n, &k);
set<int> s;
int x, a;
for (int i = 0; i < n; i++) {
x = 0;
for (int j = 0; j < k; j++) {
scanf(" %d", &a);
if (a) x += 1 << j;
}
s.insert(x);
}
vector<int> v;
for (auto i : s) v.push_back(i);
for (int i = 0; i < v.size(); i++) {
for (int j = i; j < v.size(); j++) {
if ((v[i] & v[j]) == 0) {
cout << "YES"
<< "\n";
return 0;
}
}
}
cout << "NO"
<< "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 5e3 + 1, INF = 1e9, MOD = 998244353,
MODH = 999998727899999ll;
long long n, k, m[4];
set<long long> s;
int32_t main() {
ios_base::sync_with_stdio(0);
cin >> n >> k;
for (long long i = 0; i < n; ++i) {
long long t = 0;
for (long long j = 0; j < k; ++j) {
long long a;
cin >> a;
if (a == 1) {
t += (1 << j);
} else {
m[j] = 1;
}
}
s.insert(t);
}
for (long long i = 0; i < k; ++i) {
if (m[i] == 0) {
cout << "NO\n";
return 0;
}
}
if (s.count(0)) {
cout << "YES\n";
return 0;
}
for (long long i = 0; i < k; ++i) {
long long t = (1 << i);
if (s.count(t)) {
cout << "YES\n";
return 0;
}
}
for (long long i = 0; i < k; ++i) {
for (long long j = i + 1; j < k; ++j) {
long long t = (1 << i) + (1 << j), p = (1 << k) - 1 - t;
if (s.count(t) && s.count(p)) {
cout << "YES\n";
return 0;
}
}
}
cout << "NO\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int cnt[25];
int n, k;
int main() {
while (~scanf("%d%d", &n, &k)) {
memset(cnt, 0, sizeof(cnt));
for (int i = 0; i < n; i++) {
int cur = 0;
for (int j = 0; j < k; j++) {
int tp;
scanf("%d", &tp);
cur *= 2;
cur += tp;
}
cnt[cur]++;
}
int ans = 0;
for (int i = 0; i < 16; i++) {
for (int j = 0; j < 16; j++) {
if (cnt[i] != 0 && cnt[j] != 0 && (i & j) == 0) {
ans = 1;
break;
}
}
if (ans == 1) break;
}
if (ans == 1)
printf("YES\n");
else
printf("NO\n");
}
}
|
#include <bits/stdc++.h>
using namespace std;
int degr[17] = {1, 2, 4, 8, 16, 32, 64, 128, 256,
512, 1024, 2048, 4096, 8192, 16384, 32768, 65536};
int get_byte(int a, int k) { return a & degr[k]; }
int main() {
int n, k;
cin >> n >> k;
bool answer = false;
int n_masks = degr[k];
vector<int> masks(n_masks, 0);
for (int i = 0; i < n; i++) {
int current_mask = 0;
for (int j = 0; j < k; j++) {
int bit;
cin >> bit;
current_mask += bit * degr[j];
}
masks[current_mask]++;
}
int max_bust = degr[n_masks];
for (int i = 0; i < max_bust; i++) {
int alls = 0;
vector<int> n_task(k, 0);
for (int j = 0; j < n_masks; j++) {
if (masks[j] == 0) continue;
if (!get_byte(i, j)) continue;
alls++;
for (int l = 0; l < k; l++) {
if (get_byte(j, l)) n_task[l]++;
}
}
if (!alls) continue;
bool this_answer = true;
for (int l = 0; l < k; l++) {
if (2 * n_task[l] > alls) this_answer = false;
}
if (this_answer) {
answer = true;
break;
}
}
if (answer)
cout << "YES";
else
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int cnt[1 << 7];
int main() {
int n, k;
scanf("%d %d", &n, &k);
memset(cnt, 0, sizeof cnt);
for (int i = 0; i < n; ++i) {
int tt = 0, x;
for (int j = k - 1; j >= 0; --j) {
scanf("%d", &x);
tt |= (x << j);
}
cnt[tt]++;
for (int i = 0; i < 16; ++i) {
if ((i & tt) == 0 && cnt[i] > 0) {
puts("YES");
return 0;
}
}
}
puts("NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[100001];
int main() {
int n, k, d;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
int p = 0;
for (int j = k - 1; j >= 0; j--) {
cin >> d;
if (d) p += (1 << j);
}
a[p]++;
}
for (int i = 0; i < 16; i++) {
for (int j = 0; j < 16; j++) {
if (((i & j) == 0) && a[i] && a[j]) {
cout << "YES";
return 0;
}
}
}
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int vis[1 << 4], a[40];
int main() {
int n, k, m, cnt = 0;
scanf("%d%d", &n, &k);
for (int i = 0; i < n; ++i) {
int num = 0;
for (int j = 0; j < k; ++j) {
scanf("%d", &m);
num = num << 1 | m;
}
if (!num) return 0 * puts("YES");
if (++vis[num] == 1) a[cnt++] = num;
}
for (int i = 0; i < cnt; ++i)
for (int j = i + 1; j < cnt; ++j)
if ((a[i] & a[j]) == 0) return 0 * puts("YES");
puts("NO");
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.